./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/array-memsafety/openbsd_cstrncpy-alloca-2.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 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:41:56,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:41:56,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:41:56,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:41:56,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:41:56,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:41:56,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:41:56,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:41:56,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:41:56,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:41:56,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:41:56,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:41:56,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:41:56,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:41:56,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:41:56,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:41:56,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:41:56,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:41:56,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:41:56,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:41:56,155 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:41:56,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:41:56,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:41:56,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:41:56,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:41:56,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:41:56,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:41:56,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:41:56,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:41:56,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:41:56,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:41:56,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:41:56,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:41:56,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:41:56,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:41:56,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:41:56,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:41:56,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:41:56,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:41:56,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:41:56,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:41:56,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:41:56,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:41:56,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:41:56,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:41:56,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:41:56,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:41:56,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:41:56,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:41:56,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:41:56,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:41:56,205 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:41:56,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:41:56,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:41:56,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:41:56,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:41:56,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:41:56,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:41:56,207 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:41:56,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:41:56,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:41:56,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:41:56,208 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:41:56,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:41:56,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:41:56,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:41:56,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:41:56,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:41:56,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:41:56,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:41:56,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:41:56,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:41:56,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:41:56,210 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 -> 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 [2022-07-23 05:41:56,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:41:56,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:41:56,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:41:56,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:41:56,409 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:41:56,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-23 05:41:56,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e153596dd/1deacea23f0b4bae8fac1caaadbef075/FLAG2d59f670a [2022-07-23 05:41:56,861 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:41:56,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-23 05:41:56,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e153596dd/1deacea23f0b4bae8fac1caaadbef075/FLAG2d59f670a [2022-07-23 05:41:56,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e153596dd/1deacea23f0b4bae8fac1caaadbef075 [2022-07-23 05:41:56,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:41:56,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:41:56,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:41:56,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:41:56,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:41:56,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:41:56" (1/1) ... [2022-07-23 05:41:56,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19aff276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:56, skipping insertion in model container [2022-07-23 05:41:56,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:41:56" (1/1) ... [2022-07-23 05:41:56,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:41:56,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:41:57,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:41:57,114 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:41:57,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:41:57,176 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:41:57,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57 WrapperNode [2022-07-23 05:41:57,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:41:57,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:41:57,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:41:57,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:41:57,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,214 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-07-23 05:41:57,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:41:57,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:41:57,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:41:57,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:41:57,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:41:57,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:41:57,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:41:57,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:41:57,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (1/1) ... [2022-07-23 05:41:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:41:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:57,252 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-23 05:41:57,256 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-23 05:41:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:41:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:41:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:41:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:41:57,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:41:57,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:41:57,358 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:41:57,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:41:57,505 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:41:57,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:41:57,510 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 05:41:57,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:41:57 BoogieIcfgContainer [2022-07-23 05:41:57,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:41:57,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:41:57,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:41:57,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:41:57,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:41:56" (1/3) ... [2022-07-23 05:41:57,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f2f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:41:57, skipping insertion in model container [2022-07-23 05:41:57,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:41:57" (2/3) ... [2022-07-23 05:41:57,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f2f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:41:57, skipping insertion in model container [2022-07-23 05:41:57,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:41:57" (3/3) ... [2022-07-23 05:41:57,519 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-2.i [2022-07-23 05:41:57,529 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:41:57,530 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-23 05:41:57,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:41:57,562 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@3920c34d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@486ad7ab [2022-07-23 05:41:57,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-23 05:41:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:41:57,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:57,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:57,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-23 05:41:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:57,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836778042] [2022-07-23 05:41:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:57,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:57,759 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-23 05:41:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:57,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836778042] [2022-07-23 05:41:57,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836778042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:57,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:57,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:41:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590585181] [2022-07-23 05:41:57,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:57,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:41:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:41:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:41:57,790 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:57,825 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-07-23 05:41:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:41:57,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 05:41:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:57,833 INFO L225 Difference]: With dead ends: 36 [2022-07-23 05:41:57,834 INFO L226 Difference]: Without dead ends: 34 [2022-07-23 05:41:57,836 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-23 05:41:57,839 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:57,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-23 05:41:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-23 05:41:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-23 05:41:57,865 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2022-07-23 05:41:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:57,865 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-23 05:41:57,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-23 05:41:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:41:57,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:57,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:57,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:41:57,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-23 05:41:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:57,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063166169] [2022-07-23 05:41:57,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:57,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:57,935 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-23 05:41:57,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:57,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063166169] [2022-07-23 05:41:57,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063166169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:57,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:57,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:41:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50557667] [2022-07-23 05:41:57,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:57,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:41:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:41:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:41:57,941 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:57,971 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-23 05:41:57,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:41:57,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 05:41:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:57,973 INFO L225 Difference]: With dead ends: 33 [2022-07-23 05:41:57,973 INFO L226 Difference]: Without dead ends: 33 [2022-07-23 05:41:57,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:41:57,977 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:57,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-23 05:41:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-23 05:41:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-23 05:41:57,985 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-23 05:41:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:57,985 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-23 05:41:57,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-23 05:41:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:41:57,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:57,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:57,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:41:57,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-23 05:41:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:57,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392620664] [2022-07-23 05:41:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:58,036 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-23 05:41:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:58,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392620664] [2022-07-23 05:41:58,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392620664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:58,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:58,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:41:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650069405] [2022-07-23 05:41:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:58,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:41:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:58,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:41:58,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:41:58,039 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:58,064 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-23 05:41:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:41:58,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 05:41:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:58,068 INFO L225 Difference]: With dead ends: 59 [2022-07-23 05:41:58,068 INFO L226 Difference]: Without dead ends: 59 [2022-07-23 05:41:58,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:41:58,070 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:58,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-23 05:41:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-07-23 05:41:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-23 05:41:58,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2022-07-23 05:41:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:58,079 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-23 05:41:58,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-23 05:41:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:41:58,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:58,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:58,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:41:58,080 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-23 05:41:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:58,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986867452] [2022-07-23 05:41:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:58,145 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-23 05:41:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:58,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986867452] [2022-07-23 05:41:58,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986867452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:58,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:58,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:41:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897711158] [2022-07-23 05:41:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:58,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:41:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:41:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:41:58,149 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:58,204 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-23 05:41:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:41:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 05:41:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:58,208 INFO L225 Difference]: With dead ends: 63 [2022-07-23 05:41:58,208 INFO L226 Difference]: Without dead ends: 63 [2022-07-23 05:41:58,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:41:58,208 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:58,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-23 05:41:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2022-07-23 05:41:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-23 05:41:58,211 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 7 [2022-07-23 05:41:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:58,211 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-23 05:41:58,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-23 05:41:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:41:58,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:58,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:58,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:41:58,212 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751785, now seen corresponding path program 1 times [2022-07-23 05:41:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:58,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704757341] [2022-07-23 05:41:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:58,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:58,288 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-23 05:41:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:58,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704757341] [2022-07-23 05:41:58,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704757341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:58,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:58,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:41:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118445422] [2022-07-23 05:41:58,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:58,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:41:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:58,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:41:58,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:41:58,291 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:58,344 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-23 05:41:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:41:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 05:41:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:58,345 INFO L225 Difference]: With dead ends: 39 [2022-07-23 05:41:58,346 INFO L226 Difference]: Without dead ends: 39 [2022-07-23 05:41:58,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:41:58,346 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:58,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-23 05:41:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-23 05:41:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.5) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-07-23 05:41:58,349 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2022-07-23 05:41:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:58,350 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-07-23 05:41:58,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-07-23 05:41:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:41:58,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:58,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:58,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:41:58,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751784, now seen corresponding path program 1 times [2022-07-23 05:41:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630977982] [2022-07-23 05:41:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:58,452 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-23 05:41:58,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:58,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630977982] [2022-07-23 05:41:58,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630977982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:58,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:58,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:41:58,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521067200] [2022-07-23 05:41:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:58,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:41:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:41:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:41:58,453 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:58,582 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-23 05:41:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:41:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 05:41:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:58,586 INFO L225 Difference]: With dead ends: 43 [2022-07-23 05:41:58,586 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 05:41:58,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:41:58,589 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 144 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:58,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 83 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:41:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 05:41:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-23 05:41:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-23 05:41:58,600 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2022-07-23 05:41:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:58,601 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-23 05:41:58,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-23 05:41:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:41:58,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:58,602 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:58,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:41:58,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-23 05:41:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:58,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633372659] [2022-07-23 05:41:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:58,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633372659] [2022-07-23 05:41:58,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633372659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103808505] [2022-07-23 05:41:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:58,661 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-23 05:41:58,662 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-23 05:41:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:58,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:41:58,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:58,760 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:41:58,761 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:41:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:58,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:58,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103808505] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:58,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:58,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-23 05:41:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133276980] [2022-07-23 05:41:58,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:58,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 05:41:58,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:58,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 05:41:58,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:41:58,967 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:59,117 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-07-23 05:41:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:41:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 05:41:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:59,118 INFO L225 Difference]: With dead ends: 89 [2022-07-23 05:41:59,118 INFO L226 Difference]: Without dead ends: 89 [2022-07-23 05:41:59,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-23 05:41:59,119 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 165 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:59,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 201 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:41:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-23 05:41:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 36. [2022-07-23 05:41:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-23 05:41:59,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 11 [2022-07-23 05:41:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:59,122 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-23 05:41:59,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-23 05:41:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:41:59,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:59,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:59,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 05:41:59,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:59,342 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash -466410634, now seen corresponding path program 1 times [2022-07-23 05:41:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:59,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102049534] [2022-07-23 05:41:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:59,389 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-23 05:41:59,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:59,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102049534] [2022-07-23 05:41:59,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102049534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:59,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:59,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:41:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965144853] [2022-07-23 05:41:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:59,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:41:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:41:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:41:59,391 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:59,415 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-23 05:41:59,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:41:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:41:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:59,416 INFO L225 Difference]: With dead ends: 73 [2022-07-23 05:41:59,416 INFO L226 Difference]: Without dead ends: 73 [2022-07-23 05:41:59,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-23 05:41:59,417 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:59,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-23 05:41:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-23 05:41:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.35) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-23 05:41:59,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-23 05:41:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:59,430 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-23 05:41:59,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-23 05:41:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:41:59,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:59,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:59,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:41:59,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash -467763174, now seen corresponding path program 1 times [2022-07-23 05:41:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:59,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486039418] [2022-07-23 05:41:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:59,506 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-23 05:41:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:59,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486039418] [2022-07-23 05:41:59,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486039418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:59,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:59,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:41:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331163729] [2022-07-23 05:41:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:59,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:41:59,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:59,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:41:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:41:59,508 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:59,561 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-23 05:41:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:41:59,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:41:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:59,563 INFO L225 Difference]: With dead ends: 47 [2022-07-23 05:41:59,563 INFO L226 Difference]: Without dead ends: 47 [2022-07-23 05:41:59,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:41:59,564 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:59,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 64 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-23 05:41:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-23 05:41:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-23 05:41:59,566 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2022-07-23 05:41:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:59,566 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-23 05:41:59,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-23 05:41:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:41:59,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:59,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:59,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:41:59,568 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash -467763173, now seen corresponding path program 1 times [2022-07-23 05:41:59,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:59,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361064392] [2022-07-23 05:41:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:59,617 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-23 05:41:59,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:59,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361064392] [2022-07-23 05:41:59,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361064392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:59,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:59,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:41:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713282452] [2022-07-23 05:41:59,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:59,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:41:59,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:41:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:41:59,619 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:59,678 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-07-23 05:41:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:41:59,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:41:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:59,679 INFO L225 Difference]: With dead ends: 47 [2022-07-23 05:41:59,679 INFO L226 Difference]: Without dead ends: 47 [2022-07-23 05:41:59,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:41:59,680 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 84 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:59,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-23 05:41:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-23 05:41:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-23 05:41:59,682 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-23 05:41:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:59,682 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-23 05:41:59,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-23 05:41:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:41:59,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:59,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:59,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:41:59,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 213647736, now seen corresponding path program 1 times [2022-07-23 05:41:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296783921] [2022-07-23 05:41:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:59,725 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-23 05:41:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:59,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296783921] [2022-07-23 05:41:59,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296783921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:59,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:59,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:41:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641178330] [2022-07-23 05:41:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:59,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:41:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:41:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:41:59,727 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:59,742 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-23 05:41:59,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:41:59,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:41:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:59,744 INFO L225 Difference]: With dead ends: 49 [2022-07-23 05:41:59,744 INFO L226 Difference]: Without dead ends: 49 [2022-07-23 05:41:59,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:41:59,744 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:59,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-23 05:41:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-07-23 05:41:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-23 05:41:59,748 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2022-07-23 05:41:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:59,749 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-23 05:41:59,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-23 05:41:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 05:41:59,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:59,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:59,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:41:59,750 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901600, now seen corresponding path program 1 times [2022-07-23 05:41:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:59,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849281835] [2022-07-23 05:41:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:59,794 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-23 05:41:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:59,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849281835] [2022-07-23 05:41:59,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849281835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:59,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:59,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:41:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852357281] [2022-07-23 05:41:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:59,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:41:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:41:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:41:59,796 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:59,824 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-23 05:41:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:41:59,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 05:41:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:59,825 INFO L225 Difference]: With dead ends: 35 [2022-07-23 05:41:59,825 INFO L226 Difference]: Without dead ends: 35 [2022-07-23 05:41:59,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:41:59,826 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:59,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-23 05:41:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-23 05:41:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-23 05:41:59,828 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2022-07-23 05:41:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:59,829 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-23 05:41:59,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-23 05:41:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 05:41:59,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:59,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:59,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 05:41:59,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901599, now seen corresponding path program 1 times [2022-07-23 05:41:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:59,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416701732] [2022-07-23 05:41:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:59,880 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-23 05:41:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:59,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416701732] [2022-07-23 05:41:59,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416701732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:41:59,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:41:59,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:41:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833035271] [2022-07-23 05:41:59,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:41:59,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:41:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:41:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:41:59,881 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:59,913 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-07-23 05:41:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:41:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 05:41:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:59,914 INFO L225 Difference]: With dead ends: 69 [2022-07-23 05:41:59,914 INFO L226 Difference]: Without dead ends: 69 [2022-07-23 05:41:59,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:41:59,915 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:59,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 128 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:41:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-23 05:41:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-23 05:41:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-23 05:41:59,917 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 16 [2022-07-23 05:41:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:59,917 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-23 05:41:59,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-23 05:41:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 05:41:59,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:59,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:59,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:41:59,918 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:41:59,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1889707613, now seen corresponding path program 1 times [2022-07-23 05:41:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:59,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679838939] [2022-07-23 05:41:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:00,058 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-23 05:42:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679838939] [2022-07-23 05:42:00,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679838939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:42:00,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:42:00,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 05:42:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506497005] [2022-07-23 05:42:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:42:00,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 05:42:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 05:42:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:42:00,060 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:00,210 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-07-23 05:42:00,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:42:00,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 05:42:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:00,212 INFO L225 Difference]: With dead ends: 57 [2022-07-23 05:42:00,212 INFO L226 Difference]: Without dead ends: 57 [2022-07-23 05:42:00,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-23 05:42:00,213 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:00,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:42:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-23 05:42:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-23 05:42:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-23 05:42:00,216 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 16 [2022-07-23 05:42:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:00,216 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-23 05:42:00,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-23 05:42:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:42:00,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:00,218 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:00,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:42:00,218 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1717205610, now seen corresponding path program 1 times [2022-07-23 05:42:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133023180] [2022-07-23 05:42:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133023180] [2022-07-23 05:42:00,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133023180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:42:00,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:42:00,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:42:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655245174] [2022-07-23 05:42:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:42:00,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:42:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:42:00,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:42:00,276 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:00,301 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-07-23 05:42:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:42:00,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:42:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:00,302 INFO L225 Difference]: With dead ends: 61 [2022-07-23 05:42:00,302 INFO L226 Difference]: Without dead ends: 61 [2022-07-23 05:42:00,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:42:00,303 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:00,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:42:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-23 05:42:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2022-07-23 05:42:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-07-23 05:42:00,305 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 17 [2022-07-23 05:42:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:00,305 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-07-23 05:42:00,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-07-23 05:42:00,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:42:00,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:00,305 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:00,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:42:00,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1566644436, now seen corresponding path program 1 times [2022-07-23 05:42:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:00,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580543663] [2022-07-23 05:42:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:00,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580543663] [2022-07-23 05:42:00,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580543663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:42:00,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:42:00,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 05:42:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388461522] [2022-07-23 05:42:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:42:00,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:42:00,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:00,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:42:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:42:00,379 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:00,504 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-07-23 05:42:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:42:00,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:42:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:00,505 INFO L225 Difference]: With dead ends: 85 [2022-07-23 05:42:00,505 INFO L226 Difference]: Without dead ends: 85 [2022-07-23 05:42:00,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-23 05:42:00,506 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:00,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:42:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-23 05:42:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2022-07-23 05:42:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.208955223880597) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-23 05:42:00,508 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 17 [2022-07-23 05:42:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:00,508 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-23 05:42:00,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-23 05:42:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:42:00,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:00,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:00,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 05:42:00,508 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash 286780758, now seen corresponding path program 1 times [2022-07-23 05:42:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602596684] [2022-07-23 05:42:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:00,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602596684] [2022-07-23 05:42:00,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602596684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:42:00,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:42:00,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 05:42:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234414083] [2022-07-23 05:42:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:42:00,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 05:42:00,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:00,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 05:42:00,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:42:00,600 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:00,736 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-23 05:42:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:42:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-23 05:42:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:00,737 INFO L225 Difference]: With dead ends: 107 [2022-07-23 05:42:00,737 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 05:42:00,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-07-23 05:42:00,738 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:00,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 176 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:42:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 05:42:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2022-07-23 05:42:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-07-23 05:42:00,740 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 17 [2022-07-23 05:42:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:00,740 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-07-23 05:42:00,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-07-23 05:42:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:42:00,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:00,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:00,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 05:42:00,741 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:00,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2041976217, now seen corresponding path program 1 times [2022-07-23 05:42:00,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:00,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504432745] [2022-07-23 05:42:00,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:00,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:00,787 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-23 05:42:00,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:00,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504432745] [2022-07-23 05:42:00,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504432745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:42:00,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:42:00,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:42:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172123945] [2022-07-23 05:42:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:42:00,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:42:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:00,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:42:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:42:00,789 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:00,798 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-07-23 05:42:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:42:00,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:42:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:00,799 INFO L225 Difference]: With dead ends: 72 [2022-07-23 05:42:00,799 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 05:42:00,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-23 05:42:00,800 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:00,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:42:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 05:42:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-23 05:42:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-23 05:42:00,801 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2022-07-23 05:42:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:00,801 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-23 05:42:00,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-23 05:42:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 05:42:00,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:00,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:00,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 05:42:00,803 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2012971173, now seen corresponding path program 1 times [2022-07-23 05:42:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:00,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261460588] [2022-07-23 05:42:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:01,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:01,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261460588] [2022-07-23 05:42:01,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261460588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:01,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393533988] [2022-07-23 05:42:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:01,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:01,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:01,011 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-23 05:42:01,031 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-23 05:42:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:01,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 05:42:01,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:01,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:42:01,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-23 05:42:01,102 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 10 treesize of output 8 [2022-07-23 05:42:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:01,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:01,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393533988] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:01,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:01,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-23 05:42:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16323770] [2022-07-23 05:42:01,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:01,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 05:42:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 05:42:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-07-23 05:42:01,729 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:03,019 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-07-23 05:42:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-23 05:42:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 05:42:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:03,021 INFO L225 Difference]: With dead ends: 84 [2022-07-23 05:42:03,021 INFO L226 Difference]: Without dead ends: 61 [2022-07-23 05:42:03,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=432, Invalid=2648, Unknown=0, NotChecked=0, Total=3080 [2022-07-23 05:42:03,022 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:03,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 252 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:42:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-23 05:42:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-07-23 05:42:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-23 05:42:03,023 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 20 [2022-07-23 05:42:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:03,023 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-23 05:42:03,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-23 05:42:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 05:42:03,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:03,024 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:03,043 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-23 05:42:03,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:03,231 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash -718716967, now seen corresponding path program 1 times [2022-07-23 05:42:03,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:03,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755114810] [2022-07-23 05:42:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:03,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:03,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:03,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755114810] [2022-07-23 05:42:03,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755114810] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664117232] [2022-07-23 05:42:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:03,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:03,347 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-23 05:42:03,349 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-23 05:42:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:03,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 05:42:03,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:03,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:03,629 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-23 05:42:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:03,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664117232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:03,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:03,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-07-23 05:42:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655744640] [2022-07-23 05:42:03,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:03,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 05:42:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 05:42:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-07-23 05:42:03,646 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:03,850 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-07-23 05:42:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:42:03,851 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-23 05:42:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:03,851 INFO L225 Difference]: With dead ends: 56 [2022-07-23 05:42:03,851 INFO L226 Difference]: Without dead ends: 56 [2022-07-23 05:42:03,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2022-07-23 05:42:03,852 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 255 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:03,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 95 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:42:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-23 05:42:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-07-23 05:42:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-23 05:42:03,853 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 21 [2022-07-23 05:42:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:03,853 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-23 05:42:03,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-23 05:42:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:42:03,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:03,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:03,872 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-23 05:42:04,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:04,055 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash -805389510, now seen corresponding path program 1 times [2022-07-23 05:42:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034383170] [2022-07-23 05:42:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:42:04,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:04,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034383170] [2022-07-23 05:42:04,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034383170] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:04,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383238545] [2022-07-23 05:42:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:04,196 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-23 05:42:04,197 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-23 05:42:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:04,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 05:42:04,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:42:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-23 05:42:04,272 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 10 treesize of output 8 [2022-07-23 05:42:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:42:04,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:04,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:42:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:42:04,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383238545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:04,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:04,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-07-23 05:42:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158938258] [2022-07-23 05:42:04,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:04,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-23 05:42:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-23 05:42:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-07-23 05:42:04,731 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:04,964 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-07-23 05:42:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:42:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 05:42:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:04,965 INFO L225 Difference]: With dead ends: 52 [2022-07-23 05:42:04,965 INFO L226 Difference]: Without dead ends: 52 [2022-07-23 05:42:04,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:42:04,966 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:04,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 113 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:42:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-23 05:42:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-23 05:42:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-23 05:42:04,967 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-07-23 05:42:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:04,967 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-23 05:42:04,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-23 05:42:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:42:04,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:04,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:04,984 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-23 05:42:05,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:05,168 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash -279519168, now seen corresponding path program 1 times [2022-07-23 05:42:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:05,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827409502] [2022-07-23 05:42:05,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:42:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:05,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827409502] [2022-07-23 05:42:05,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827409502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:05,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166955992] [2022-07-23 05:42:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:05,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:05,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:05,350 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-23 05:42:05,350 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-23 05:42:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:05,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 05:42:05,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:05,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:42:05,431 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 9 treesize of output 11 [2022-07-23 05:42:05,433 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 10 treesize of output 8 [2022-07-23 05:42:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:42:05,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:42:06,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166955992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:06,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:06,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-23 05:42:06,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648173942] [2022-07-23 05:42:06,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:06,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 05:42:06,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:06,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 05:42:06,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2022-07-23 05:42:06,035 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:06,769 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-07-23 05:42:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:42:06,771 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-23 05:42:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:06,771 INFO L225 Difference]: With dead ends: 51 [2022-07-23 05:42:06,771 INFO L226 Difference]: Without dead ends: 37 [2022-07-23 05:42:06,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2022-07-23 05:42:06,772 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:06,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:42:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-23 05:42:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-07-23 05:42:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-23 05:42:06,774 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-23 05:42:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:06,775 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-23 05:42:06,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-23 05:42:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:42:06,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:06,776 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:06,794 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-23 05:42:06,992 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,SelfDestructingSolverStorable21 [2022-07-23 05:42:06,992 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -57121321, now seen corresponding path program 2 times [2022-07-23 05:42:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:06,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026980216] [2022-07-23 05:42:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:07,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026980216] [2022-07-23 05:42:07,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026980216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769031762] [2022-07-23 05:42:07,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:42:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:07,199 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-23 05:42:07,200 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-23 05:42:07,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:42:07,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:07,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-23 05:42:07,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:07,269 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 10 treesize of output 8 [2022-07-23 05:42:07,302 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 14 treesize of output 10 [2022-07-23 05:42:07,476 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 17 treesize of output 19 [2022-07-23 05:42:07,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:07,607 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 20 treesize of output 20 [2022-07-23 05:42:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:07,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:07,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-23 05:42:07,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)))) is different from false [2022-07-23 05:42:08,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-23 05:42:08,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:08,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:42:08,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:08,039 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 37 treesize of output 37 [2022-07-23 05:42:08,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 05:42:08,056 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 7 [2022-07-23 05:42:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-23 05:42:08,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769031762] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:08,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:08,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-07-23 05:42:08,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904687603] [2022-07-23 05:42:08,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:08,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 05:42:08,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:08,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 05:42:08,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1079, Unknown=3, NotChecked=204, Total=1406 [2022-07-23 05:42:08,155 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:08,716 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-23 05:42:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:42:08,716 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 05:42:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:08,717 INFO L225 Difference]: With dead ends: 58 [2022-07-23 05:42:08,717 INFO L226 Difference]: Without dead ends: 45 [2022-07-23 05:42:08,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=254, Invalid=2107, Unknown=3, NotChecked=288, Total=2652 [2022-07-23 05:42:08,718 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:08,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 263 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 212 Unchecked, 0.1s Time] [2022-07-23 05:42:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-23 05:42:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-23 05:42:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-23 05:42:08,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 27 [2022-07-23 05:42:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:08,719 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-23 05:42:08,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-23 05:42:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:42:08,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:08,720 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:08,736 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-23 05:42:08,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:08,920 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash 614687385, now seen corresponding path program 2 times [2022-07-23 05:42:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:08,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315082183] [2022-07-23 05:42:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:42:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:09,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315082183] [2022-07-23 05:42:09,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315082183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:09,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898136699] [2022-07-23 05:42:09,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:42:09,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:09,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:09,152 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-23 05:42:09,153 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-23 05:42:09,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:42:09,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:09,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 05:42:09,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:09,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:42:09,244 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 9 treesize of output 11 [2022-07-23 05:42:09,246 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 10 treesize of output 8 [2022-07-23 05:42:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:42:09,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:42:09,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898136699] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:09,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-23 05:42:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096616445] [2022-07-23 05:42:09,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:09,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 05:42:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 05:42:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 05:42:09,976 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:10,952 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-23 05:42:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:42:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 05:42:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:10,953 INFO L225 Difference]: With dead ends: 54 [2022-07-23 05:42:10,953 INFO L226 Difference]: Without dead ends: 54 [2022-07-23 05:42:10,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=349, Invalid=2407, Unknown=0, NotChecked=0, Total=2756 [2022-07-23 05:42:10,954 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:10,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 161 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:42:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-23 05:42:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-23 05:42:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-23 05:42:10,956 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2022-07-23 05:42:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:10,956 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-23 05:42:10,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-23 05:42:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 05:42:10,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:10,956 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:11,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:11,157 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1981775400, now seen corresponding path program 3 times [2022-07-23 05:42:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:11,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101335651] [2022-07-23 05:42:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:11,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101335651] [2022-07-23 05:42:11,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101335651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:11,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941027332] [2022-07-23 05:42:11,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:42:11,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:11,389 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-23 05:42:11,394 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-23 05:42:11,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:42:11,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:11,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-23 05:42:11,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:11,631 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 14 treesize of output 10 [2022-07-23 05:42:11,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:42:11,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 05:42:11,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:42:11,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 05:42:11,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:42:11,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:11,971 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 17 treesize of output 10 [2022-07-23 05:42:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:11,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:19,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-23 05:42:20,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-23 05:42:21,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-23 05:42:21,556 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 372 treesize of output 360 [2022-07-23 05:42:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-23 05:42:21,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941027332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:21,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:21,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2022-07-23 05:42:21,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576371517] [2022-07-23 05:42:21,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:21,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 05:42:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 05:42:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1364, Unknown=10, NotChecked=228, Total=1722 [2022-07-23 05:42:21,875 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:22,635 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (< 2 |c_ULTIMATE.start_main_~length~0#1|) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (<= 3 |c_ULTIMATE.start_main_~length~0#1|) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~length~0#1| 3) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2022-07-23 05:42:23,174 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_cstrncpy_~src#1.base| |c_ULTIMATE.start_cstrncpy_~dst#1.base|)) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (<= |ULTIMATE.start_main_~length~0#1| 3) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (= |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 0) (= |c_ULTIMATE.start_cstrncpy_~src#1.offset| 0)) is different from false [2022-07-23 05:42:23,696 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrncpy_~d~0#1.base| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (= |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|)))) is different from false [2022-07-23 05:42:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:23,905 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-23 05:42:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:42:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-23 05:42:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:23,905 INFO L225 Difference]: With dead ends: 78 [2022-07-23 05:42:23,906 INFO L226 Difference]: Without dead ends: 59 [2022-07-23 05:42:23,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=217, Invalid=2344, Unknown=13, NotChecked=618, Total=3192 [2022-07-23 05:42:23,907 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:23,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 346 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 193 Unchecked, 0.1s Time] [2022-07-23 05:42:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-23 05:42:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-23 05:42:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-07-23 05:42:23,908 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 37 [2022-07-23 05:42:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:23,909 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-07-23 05:42:23,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-07-23 05:42:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 05:42:23,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:23,909 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:23,927 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-23 05:42:24,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-23 05:42:24,121 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 207254747, now seen corresponding path program 4 times [2022-07-23 05:42:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875538249] [2022-07-23 05:42:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:24,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875538249] [2022-07-23 05:42:24,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875538249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:24,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734969284] [2022-07-23 05:42:24,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:42:24,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:24,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:24,267 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-23 05:42:24,268 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-23 05:42:24,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:42:24,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:24,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 05:42:24,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:24,383 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:42:24,383 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:42:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:24,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:24,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734969284] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:24,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:24,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-07-23 05:42:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71345063] [2022-07-23 05:42:24,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 05:42:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 05:42:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 05:42:25,006 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:25,586 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-07-23 05:42:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 05:42:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-23 05:42:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:25,587 INFO L225 Difference]: With dead ends: 56 [2022-07-23 05:42:25,587 INFO L226 Difference]: Without dead ends: 56 [2022-07-23 05:42:25,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2022-07-23 05:42:25,588 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 193 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:25,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 217 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:42:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-23 05:42:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-23 05:42:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-07-23 05:42:25,589 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 41 [2022-07-23 05:42:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:25,589 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-07-23 05:42:25,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-07-23 05:42:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-23 05:42:25,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:25,590 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:25,606 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-23 05:42:25,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-23 05:42:25,791 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1595560281, now seen corresponding path program 5 times [2022-07-23 05:42:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:25,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919026707] [2022-07-23 05:42:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:26,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:26,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919026707] [2022-07-23 05:42:26,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919026707] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:26,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842490213] [2022-07-23 05:42:26,126 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:42:26,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:26,128 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-23 05:42:26,129 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-23 05:42:26,264 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-23 05:42:26,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:26,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-23 05:42:26,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:26,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:42:26,412 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 14 treesize of output 10 [2022-07-23 05:42:26,558 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 17 treesize of output 19 [2022-07-23 05:42:26,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, 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-23 05:42:26,634 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-23 05:42:26,646 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-23 05:42:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:26,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:26,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:42:26,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:26,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_441) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:26,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:26,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_440) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:26,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:26,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:42:26,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:26,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:26,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:42:26,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:26,711 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 37 treesize of output 37 [2022-07-23 05:42:26,713 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 7 [2022-07-23 05:42:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-23 05:42:26,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842490213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:26,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:26,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 43 [2022-07-23 05:42:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238120704] [2022-07-23 05:42:26,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:26,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-23 05:42:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-23 05:42:26,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1095, Unknown=8, NotChecked=584, Total=1806 [2022-07-23 05:42:26,876 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:27,362 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-23 05:42:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:42:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-23 05:42:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:27,363 INFO L225 Difference]: With dead ends: 88 [2022-07-23 05:42:27,363 INFO L226 Difference]: Without dead ends: 63 [2022-07-23 05:42:27,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1652, Unknown=8, NotChecked=712, Total=2550 [2022-07-23 05:42:27,364 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:27,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 475 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 280 Unchecked, 0.2s Time] [2022-07-23 05:42:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-23 05:42:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-23 05:42:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-23 05:42:27,365 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 47 [2022-07-23 05:42:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:27,365 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-23 05:42:27,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-23 05:42:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-23 05:42:27,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:27,366 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:27,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:27,566 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,SelfDestructingSolverStorable26 [2022-07-23 05:42:27,566 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1297179492, now seen corresponding path program 6 times [2022-07-23 05:42:27,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:27,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930146759] [2022-07-23 05:42:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:27,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:27,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930146759] [2022-07-23 05:42:27,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930146759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:27,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418302310] [2022-07-23 05:42:27,726 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:42:27,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:27,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:27,728 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-23 05:42:27,729 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-23 05:42:27,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-23 05:42:27,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:27,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-23 05:42:27,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:27,854 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:42:27,854 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:42:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:28,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:28,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418302310] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:28,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:28,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2022-07-23 05:42:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404361045] [2022-07-23 05:42:28,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:28,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 05:42:28,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:28,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 05:42:28,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:42:28,479 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:28,909 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-07-23 05:42:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 05:42:28,909 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-23 05:42:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:28,910 INFO L225 Difference]: With dead ends: 61 [2022-07-23 05:42:28,910 INFO L226 Difference]: Without dead ends: 61 [2022-07-23 05:42:28,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1892, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 05:42:28,911 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 221 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:28,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 263 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:42:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-23 05:42:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-07-23 05:42:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-23 05:42:28,913 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 51 [2022-07-23 05:42:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:28,913 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-23 05:42:28,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-23 05:42:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 05:42:28,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:28,914 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:28,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:29,123 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,SelfDestructingSolverStorable27 [2022-07-23 05:42:29,124 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash -351804326, now seen corresponding path program 7 times [2022-07-23 05:42:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:29,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679587829] [2022-07-23 05:42:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:29,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:29,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679587829] [2022-07-23 05:42:29,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679587829] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:29,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447722920] [2022-07-23 05:42:29,537 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:42:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:29,538 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-23 05:42:29,539 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-23 05:42:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:29,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-23 05:42:29,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:29,635 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 10 treesize of output 8 [2022-07-23 05:42:29,816 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 14 treesize of output 10 [2022-07-23 05:42:29,977 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 17 treesize of output 19 [2022-07-23 05:42:30,042 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-23 05:42:30,095 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-23 05:42:30,113 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-23 05:42:30,123 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-23 05:42:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:30,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:30,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:42:30,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:30,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:30,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:30,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:30,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:30,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_545) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:30,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:30,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:30,199 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:30,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:30,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:42:30,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:30,210 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 37 treesize of output 37 [2022-07-23 05:42:30,213 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 7 [2022-07-23 05:42:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-07-23 05:42:30,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447722920] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:30,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:30,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 51 [2022-07-23 05:42:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296442323] [2022-07-23 05:42:30,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:30,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 05:42:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 05:42:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1529, Unknown=10, NotChecked=870, Total=2550 [2022-07-23 05:42:30,408 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:31,116 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-07-23 05:42:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 05:42:31,116 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-23 05:42:31,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:31,117 INFO L225 Difference]: With dead ends: 98 [2022-07-23 05:42:31,117 INFO L226 Difference]: Without dead ends: 67 [2022-07-23 05:42:31,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=2469, Unknown=10, NotChecked=1090, Total=3782 [2022-07-23 05:42:31,122 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:31,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 611 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 690 Invalid, 0 Unknown, 520 Unchecked, 0.3s Time] [2022-07-23 05:42:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-23 05:42:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-07-23 05:42:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-23 05:42:31,124 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2022-07-23 05:42:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:31,124 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-23 05:42:31,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-23 05:42:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 05:42:31,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:31,125 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:31,142 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-23 05:42:31,338 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,SelfDestructingSolverStorable28 [2022-07-23 05:42:31,339 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash -841664547, now seen corresponding path program 8 times [2022-07-23 05:42:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542439744] [2022-07-23 05:42:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:31,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542439744] [2022-07-23 05:42:31,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542439744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:31,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287475409] [2022-07-23 05:42:31,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:42:31,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:31,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:31,572 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-23 05:42:31,574 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-23 05:42:31,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:42:31,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:31,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-23 05:42:31,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:31,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:32,213 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-23 05:42:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:32,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287475409] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:32,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:32,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 36 [2022-07-23 05:42:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531342447] [2022-07-23 05:42:32,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:32,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-23 05:42:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-23 05:42:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 05:42:32,249 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:32,971 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-07-23 05:42:32,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 05:42:32,971 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-23 05:42:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:32,972 INFO L225 Difference]: With dead ends: 72 [2022-07-23 05:42:32,972 INFO L226 Difference]: Without dead ends: 72 [2022-07-23 05:42:32,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=593, Invalid=2487, Unknown=0, NotChecked=0, Total=3080 [2022-07-23 05:42:32,973 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 554 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:32,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 330 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:42:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-23 05:42:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-23 05:42:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.044776119402985) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-07-23 05:42:32,974 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 61 [2022-07-23 05:42:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:32,974 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-07-23 05:42:32,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-07-23 05:42:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 05:42:32,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:32,975 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:32,992 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-23 05:42:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:33,184 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -321797194, now seen corresponding path program 3 times [2022-07-23 05:42:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:33,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260460025] [2022-07-23 05:42:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 26 proven. 49 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-23 05:42:33,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:33,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260460025] [2022-07-23 05:42:33,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260460025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:33,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818804231] [2022-07-23 05:42:33,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:42:33,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:33,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:33,534 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:33,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-23 05:42:33,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 05:42:33,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:33,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-23 05:42:33,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:33,721 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:42:33,721 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:42:33,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:42:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-23 05:42:34,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-23 05:42:35,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818804231] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:35,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:35,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2022-07-23 05:42:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986230894] [2022-07-23 05:42:35,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:35,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-23 05:42:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-23 05:42:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2375, Unknown=0, NotChecked=0, Total=2652 [2022-07-23 05:42:35,125 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:36,557 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-23 05:42:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 05:42:36,558 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-23 05:42:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:36,558 INFO L225 Difference]: With dead ends: 70 [2022-07-23 05:42:36,558 INFO L226 Difference]: Without dead ends: 70 [2022-07-23 05:42:36,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=764, Invalid=5556, Unknown=0, NotChecked=0, Total=6320 [2022-07-23 05:42:36,560 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:36,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:42:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-23 05:42:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-23 05:42:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-23 05:42:36,562 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2022-07-23 05:42:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:36,562 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-23 05:42:36,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-23 05:42:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 05:42:36,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:36,563 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:36,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-23 05:42:36,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:36,768 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1711491803, now seen corresponding path program 9 times [2022-07-23 05:42:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:36,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624786935] [2022-07-23 05:42:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624786935] [2022-07-23 05:42:37,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624786935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937497835] [2022-07-23 05:42:37,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:42:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:37,316 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:37,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-23 05:42:37,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-23 05:42:37,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:37,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 155 conjunts are in the unsatisfiable core [2022-07-23 05:42:37,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:37,518 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 10 treesize of output 8 [2022-07-23 05:42:37,824 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 14 treesize of output 10 [2022-07-23 05:42:38,008 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-23 05:42:38,142 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-23 05:42:38,284 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-23 05:42:38,409 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-23 05:42:38,542 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-23 05:42:38,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:42:38,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:38,662 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 17 treesize of output 10 [2022-07-23 05:42:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:38,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:38,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:42:38,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:38,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_726) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:38,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:38,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_725) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-23 05:42:38,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:38,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_724) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:38,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:38,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_723 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_723) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:38,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:38,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:42:38,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:38,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:38,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:42:38,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:38,757 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 37 treesize of output 37 [2022-07-23 05:42:38,760 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 7 [2022-07-23 05:42:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-07-23 05:42:39,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937497835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:39,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:39,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 72 [2022-07-23 05:42:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940342968] [2022-07-23 05:42:39,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:39,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-23 05:42:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-23 05:42:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3357, Unknown=12, NotChecked=1524, Total=5112 [2022-07-23 05:42:39,074 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:40,048 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-07-23 05:42:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 05:42:40,048 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-23 05:42:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:40,048 INFO L225 Difference]: With dead ends: 112 [2022-07-23 05:42:40,048 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 05:42:40,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 12 IntricatePredicates, 6 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=346, Invalid=5542, Unknown=12, NotChecked=1932, Total=7832 [2022-07-23 05:42:40,049 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:40,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 822 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 610 Unchecked, 0.2s Time] [2022-07-23 05:42:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 05:42:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-23 05:42:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-23 05:42:40,051 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2022-07-23 05:42:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:40,051 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-23 05:42:40,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-23 05:42:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 05:42:40,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:40,052 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:40,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:40,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:40,256 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1133270686, now seen corresponding path program 10 times [2022-07-23 05:42:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:40,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224637213] [2022-07-23 05:42:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:40,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224637213] [2022-07-23 05:42:40,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224637213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599359235] [2022-07-23 05:42:40,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:42:40,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:40,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:40,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-23 05:42:40,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:42:40,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:40,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-23 05:42:40,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:41,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:41,350 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-23 05:42:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:41,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599359235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:41,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:41,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 41 [2022-07-23 05:42:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976114229] [2022-07-23 05:42:41,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:41,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 05:42:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 05:42:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2022-07-23 05:42:41,405 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:42,005 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-23 05:42:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:42:42,005 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-23 05:42:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:42,006 INFO L225 Difference]: With dead ends: 80 [2022-07-23 05:42:42,006 INFO L226 Difference]: Without dead ends: 80 [2022-07-23 05:42:42,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=655, Invalid=2767, Unknown=0, NotChecked=0, Total=3422 [2022-07-23 05:42:42,007 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 294 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:42,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 397 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:42:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-23 05:42:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-07-23 05:42:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-07-23 05:42:42,008 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2022-07-23 05:42:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:42,009 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-07-23 05:42:42,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-07-23 05:42:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 05:42:42,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:42,009 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:42,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:42,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-23 05:42:42,218 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1392415964, now seen corresponding path program 11 times [2022-07-23 05:42:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:42,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288334699] [2022-07-23 05:42:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288334699] [2022-07-23 05:42:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288334699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357955983] [2022-07-23 05:42:42,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:42:42,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:42,906 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:42,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-23 05:42:43,417 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-23 05:42:43,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:43,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-23 05:42:43,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:43,434 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:42:43,437 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:42:43,443 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 10 treesize of output 8 [2022-07-23 05:42:43,791 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 14 treesize of output 10 [2022-07-23 05:42:44,004 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-23 05:42:44,157 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-23 05:42:44,313 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-23 05:42:44,456 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-23 05:42:44,605 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-23 05:42:44,771 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-23 05:42:44,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:44,922 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 17 treesize of output 17 [2022-07-23 05:42:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 45 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:45,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:46,436 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:46,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:42:46,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:46,443 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 37 treesize of output 37 [2022-07-23 05:42:46,446 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 7 [2022-07-23 05:42:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 66 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:47,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357955983] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:47,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:47,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27, 27] total 86 [2022-07-23 05:42:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420858887] [2022-07-23 05:42:47,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:47,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-23 05:42:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-23 05:42:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=6862, Unknown=5, NotChecked=0, Total=7310 [2022-07-23 05:42:47,104 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:49,446 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-07-23 05:42:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-23 05:42:49,446 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-23 05:42:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:49,447 INFO L225 Difference]: With dead ends: 134 [2022-07-23 05:42:49,447 INFO L226 Difference]: Without dead ends: 91 [2022-07-23 05:42:49,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1102, Invalid=14895, Unknown=5, NotChecked=0, Total=16002 [2022-07-23 05:42:49,448 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 208 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:49,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1051 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 490 Invalid, 0 Unknown, 386 Unchecked, 0.2s Time] [2022-07-23 05:42:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-23 05:42:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-23 05:42:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-23 05:42:49,450 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2022-07-23 05:42:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:49,450 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-23 05:42:49,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-23 05:42:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-23 05:42:49,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:49,451 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:49,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-23 05:42:49,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:49,659 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2138844579, now seen corresponding path program 12 times [2022-07-23 05:42:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:49,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902634915] [2022-07-23 05:42:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:50,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902634915] [2022-07-23 05:42:50,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902634915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:50,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839708232] [2022-07-23 05:42:50,469 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:42:50,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:50,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:50,470 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:50,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-23 05:42:50,803 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-23 05:42:50,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:50,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-23 05:42:50,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:50,818 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 10 treesize of output 8 [2022-07-23 05:42:51,287 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 14 treesize of output 10 [2022-07-23 05:42:51,531 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-23 05:42:51,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-23 05:42:51,830 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-23 05:42:51,971 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-23 05:42:52,136 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-23 05:42:52,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:42:52,452 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-23 05:42:52,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:42:52,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:52,583 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 17 treesize of output 10 [2022-07-23 05:42:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:52,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:52,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-23 05:42:52,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:52,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_950) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:52,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_949) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_948) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:52,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_947) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:52,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_946) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_945) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:42:52,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:52,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:42:52,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:52,711 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 37 treesize of output 37 [2022-07-23 05:42:52,714 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 7 [2022-07-23 05:42:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 153 not checked. [2022-07-23 05:42:53,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839708232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:53,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:53,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31, 31] total 92 [2022-07-23 05:42:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000718596] [2022-07-23 05:42:53,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:53,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-07-23 05:42:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:53,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-07-23 05:42:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5469, Unknown=16, NotChecked=2608, Total=8372 [2022-07-23 05:42:53,197 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:54,958 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-07-23 05:42:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-23 05:42:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-07-23 05:42:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:54,959 INFO L225 Difference]: With dead ends: 144 [2022-07-23 05:42:54,959 INFO L226 Difference]: Without dead ends: 95 [2022-07-23 05:42:54,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 16 IntricatePredicates, 11 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=487, Invalid=10481, Unknown=16, NotChecked=3536, Total=14520 [2022-07-23 05:42:54,960 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:54,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1499 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1066 Invalid, 0 Unknown, 1393 Unchecked, 0.4s Time] [2022-07-23 05:42:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-23 05:42:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-23 05:42:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-07-23 05:42:54,962 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2022-07-23 05:42:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:54,962 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-07-23 05:42:54,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-07-23 05:42:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-23 05:42:54,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:54,963 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:54,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:55,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:55,178 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1788632736, now seen corresponding path program 13 times [2022-07-23 05:42:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384874653] [2022-07-23 05:42:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:55,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384874653] [2022-07-23 05:42:55,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384874653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:55,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160321383] [2022-07-23 05:42:55,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:42:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:55,550 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:55,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-23 05:42:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:55,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-23 05:42:55,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:56,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:56,532 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-23 05:42:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:56,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160321383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:56,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:56,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 48 [2022-07-23 05:42:56,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795200157] [2022-07-23 05:42:56,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:56,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-23 05:42:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-23 05:42:56,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2139, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 05:42:56,578 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:57,789 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-23 05:42:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 05:42:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-07-23 05:42:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:57,790 INFO L225 Difference]: With dead ends: 100 [2022-07-23 05:42:57,790 INFO L226 Difference]: Without dead ends: 100 [2022-07-23 05:42:57,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1130, Invalid=4722, Unknown=0, NotChecked=0, Total=5852 [2022-07-23 05:42:57,791 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 513 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:57,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 676 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 05:42:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-23 05:42:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-07-23 05:42:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-23 05:42:57,794 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 91 [2022-07-23 05:42:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:57,795 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-23 05:42:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-07-23 05:42:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-23 05:42:57,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:57,795 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:57,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:57,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:57,996 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:42:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1984621730, now seen corresponding path program 14 times [2022-07-23 05:42:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:57,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642289618] [2022-07-23 05:42:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642289618] [2022-07-23 05:42:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642289618] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143500080] [2022-07-23 05:42:58,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:42:58,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:58,952 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:58,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-23 05:42:59,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:42:59,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:59,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-23 05:42:59,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:59,097 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 10 treesize of output 8 [2022-07-23 05:42:59,413 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 14 treesize of output 10 [2022-07-23 05:42:59,695 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 17 treesize of output 19 [2022-07-23 05:42:59,872 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 17 treesize of output 19 [2022-07-23 05:43:00,048 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 17 treesize of output 19 [2022-07-23 05:43:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:43:00,423 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 17 treesize of output 19 [2022-07-23 05:43:00,627 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 17 treesize of output 19 [2022-07-23 05:43:00,832 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 17 treesize of output 19 [2022-07-23 05:43:01,052 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 17 treesize of output 19 [2022-07-23 05:43:01,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:01,237 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 20 treesize of output 20 [2022-07-23 05:43:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:01,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:03,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-23 05:43:03,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)))) is different from false [2022-07-23 05:43:03,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-23 05:43:03,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:03,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:43:03,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:03,287 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 37 treesize of output 37 [2022-07-23 05:43:03,290 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 16 treesize of output 12 [2022-07-23 05:43:03,293 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 7 [2022-07-23 05:43:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-23 05:43:03,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143500080] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:03,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:03,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 34, 34] total 108 [2022-07-23 05:43:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646679887] [2022-07-23 05:43:03,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:03,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-23 05:43:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-23 05:43:03,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=10263, Unknown=8, NotChecked=624, Total=11556 [2022-07-23 05:43:03,997 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:10,871 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2022-07-23 05:43:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-23 05:43:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-23 05:43:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:10,875 INFO L225 Difference]: With dead ends: 168 [2022-07-23 05:43:10,875 INFO L226 Difference]: Without dead ends: 113 [2022-07-23 05:43:10,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4153 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1416, Invalid=20050, Unknown=8, NotChecked=876, Total=22350 [2022-07-23 05:43:10,876 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 242 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 873 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:10,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1671 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 905 Invalid, 0 Unknown, 873 Unchecked, 0.3s Time] [2022-07-23 05:43:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-23 05:43:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-23 05:43:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-07-23 05:43:10,886 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 97 [2022-07-23 05:43:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:10,886 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-07-23 05:43:10,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-07-23 05:43:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 05:43:10,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:10,888 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:10,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:11,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-23 05:43:11,091 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:43:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -682858529, now seen corresponding path program 15 times [2022-07-23 05:43:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:11,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923034329] [2022-07-23 05:43:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:12,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:12,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923034329] [2022-07-23 05:43:12,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923034329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:12,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564359792] [2022-07-23 05:43:12,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:43:12,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:12,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:12,200 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:12,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-23 05:43:13,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-23 05:43:13,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:13,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-23 05:43:13,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:13,911 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 10 treesize of output 8 [2022-07-23 05:43:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-23 05:43:14,794 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-23 05:43:14,951 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-23 05:43:15,128 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-23 05:43:15,294 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-23 05:43:15,461 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-23 05:43:15,628 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-23 05:43:15,799 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-23 05:43:15,980 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-23 05:43:16,153 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-23 05:43:16,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:43:16,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:16,311 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 17 treesize of output 10 [2022-07-23 05:43:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:16,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:16,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-23 05:43:16,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:43:16,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1224 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1224) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:43:16,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1223) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1222) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)))) is different from false [2022-07-23 05:43:16,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1221) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:43:16,405 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1220) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1219) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-23 05:43:16,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1218) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:43:16,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1217) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:43:16,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:16,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:16,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:43:16,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:16,499 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 37 treesize of output 37 [2022-07-23 05:43:16,502 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 7 [2022-07-23 05:43:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 251 not checked. [2022-07-23 05:43:17,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564359792] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:17,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:17,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37, 37] total 112 [2022-07-23 05:43:17,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652106815] [2022-07-23 05:43:17,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:17,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-23 05:43:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-23 05:43:17,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=8093, Unknown=20, NotChecked=3980, Total=12432 [2022-07-23 05:43:17,189 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:19,505 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-23 05:43:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-23 05:43:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-23 05:43:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:19,506 INFO L225 Difference]: With dead ends: 176 [2022-07-23 05:43:19,506 INFO L226 Difference]: Without dead ends: 115 [2022-07-23 05:43:19,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 142 ConstructedPredicates, 20 IntricatePredicates, 13 DeprecatedPredicates, 4331 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=574, Invalid=14738, Unknown=20, NotChecked=5260, Total=20592 [2022-07-23 05:43:19,507 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1670 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:19,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1959 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1105 Invalid, 0 Unknown, 1670 Unchecked, 0.4s Time] [2022-07-23 05:43:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-23 05:43:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2022-07-23 05:43:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.018018018018018) internal successors, (113), 111 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-07-23 05:43:19,512 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2022-07-23 05:43:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:19,512 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-07-23 05:43:19,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-07-23 05:43:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-23 05:43:19,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:19,516 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:19,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:19,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-23 05:43:19,728 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:43:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1213254494, now seen corresponding path program 16 times [2022-07-23 05:43:19,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:19,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468433241] [2022-07-23 05:43:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 120 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468433241] [2022-07-23 05:43:20,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468433241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070465224] [2022-07-23 05:43:20,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:43:20,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:20,152 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:20,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-23 05:43:20,912 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:43:20,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:20,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-23 05:43:20,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:20,938 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:43:20,938 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:43:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:21,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:22,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070465224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:22,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:22,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 72 [2022-07-23 05:43:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996156612] [2022-07-23 05:43:22,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:22,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-23 05:43:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-23 05:43:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=4643, Unknown=0, NotChecked=0, Total=5256 [2022-07-23 05:43:22,824 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:24,015 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-23 05:43:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 05:43:24,016 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-07-23 05:43:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:24,017 INFO L225 Difference]: With dead ends: 120 [2022-07-23 05:43:24,017 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 05:43:24,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1756, Invalid=7750, Unknown=0, NotChecked=0, Total=9506 [2022-07-23 05:43:24,018 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 471 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:24,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 868 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 05:43:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 05:43:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2022-07-23 05:43:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2022-07-23 05:43:24,020 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 111 [2022-07-23 05:43:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:24,020 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2022-07-23 05:43:24,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-07-23 05:43:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 05:43:24,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:24,022 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:24,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:24,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-23 05:43:24,224 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:43:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:24,224 INFO L85 PathProgramCache]: Analyzing trace with hash 547086304, now seen corresponding path program 17 times [2022-07-23 05:43:24,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:24,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148145448] [2022-07-23 05:43:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:25,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:25,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148145448] [2022-07-23 05:43:25,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148145448] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:25,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197260650] [2022-07-23 05:43:25,474 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:43:25,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:25,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:25,476 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:25,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-23 05:43:28,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-23 05:43:28,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:28,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-23 05:43:28,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:28,588 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:43:28,588 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:43:28,595 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 10 treesize of output 8 [2022-07-23 05:43:29,273 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 14 treesize of output 10 [2022-07-23 05:43:29,536 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-23 05:43:29,711 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-23 05:43:29,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 16 treesize of output 18 [2022-07-23 05:43:30,113 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-23 05:43:30,304 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-23 05:43:30,499 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-23 05:43:30,714 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-23 05:43:30,922 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-23 05:43:31,131 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-23 05:43:31,338 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-23 05:43:31,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:31,549 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 17 treesize of output 17 [2022-07-23 05:43:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 153 proven. 389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:31,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:34,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:34,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:43:34,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:34,644 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 37 treesize of output 37 [2022-07-23 05:43:34,647 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 7 [2022-07-23 05:43:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 190 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:36,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197260650] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:36,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:36,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 39, 39] total 126 [2022-07-23 05:43:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696324922] [2022-07-23 05:43:36,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:36,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-23 05:43:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:36,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-23 05:43:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=828, Invalid=14911, Unknown=11, NotChecked=0, Total=15750 [2022-07-23 05:43:36,055 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:41,118 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2022-07-23 05:43:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-23 05:43:41,118 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-23 05:43:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:41,119 INFO L225 Difference]: With dead ends: 200 [2022-07-23 05:43:41,119 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 05:43:41,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5905 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=2063, Invalid=32708, Unknown=11, NotChecked=0, Total=34782 [2022-07-23 05:43:41,121 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 395 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 820 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:41,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2614 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1200 Invalid, 0 Unknown, 820 Unchecked, 0.5s Time] [2022-07-23 05:43:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 05:43:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2022-07-23 05:43:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.015748031496063) internal successors, (129), 127 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2022-07-23 05:43:41,122 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 117 [2022-07-23 05:43:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:41,122 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2022-07-23 05:43:41,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-07-23 05:43:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-23 05:43:41,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:41,123 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:41,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:41,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:41,327 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:43:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1821215585, now seen corresponding path program 18 times [2022-07-23 05:43:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:41,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365729229] [2022-07-23 05:43:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:41,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:42,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:42,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365729229] [2022-07-23 05:43:42,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365729229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:42,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499065721] [2022-07-23 05:43:42,812 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:43:42,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:42,813 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:42,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-23 05:43:45,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-23 05:43:45,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:45,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 237 conjunts are in the unsatisfiable core [2022-07-23 05:43:45,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:45,778 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 10 treesize of output 8 [2022-07-23 05:43:46,583 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 14 treesize of output 10 [2022-07-23 05:43:46,878 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-23 05:43:47,047 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-23 05:43:47,222 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-23 05:43:47,391 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-23 05:43:47,560 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-23 05:43:47,730 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-23 05:43:47,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:43:48,061 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-23 05:43:48,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:43:48,446 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-23 05:43:48,620 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-23 05:43:48,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:43:48,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:48,782 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 17 treesize of output 10 [2022-07-23 05:43:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:48,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:48,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:43:48,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:43:48,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1555) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:43:48,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-23 05:43:48,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1554) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1553) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:43:48,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1552) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:43:48,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1551) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-23 05:43:48,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1550) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1549) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:43:48,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1548) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:43:48,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:48,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:43:48,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:43:48,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:43:48,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 11)) 0)) is different from false [2022-07-23 05:43:48,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:43:48,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:48,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:43:48,953 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:48,954 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 37 treesize of output 37 [2022-07-23 05:43:48,956 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 7 [2022-07-23 05:43:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 373 not checked. [2022-07-23 05:43:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499065721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:49,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 43, 43] total 132 [2022-07-23 05:43:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902737553] [2022-07-23 05:43:49,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-23 05:43:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-23 05:43:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=11229, Unknown=24, NotChecked=5640, Total=17292 [2022-07-23 05:43:49,852 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:53,331 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2022-07-23 05:43:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-23 05:43:53,332 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-23 05:43:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:53,333 INFO L225 Difference]: With dead ends: 208 [2022-07-23 05:43:53,333 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 05:43:53,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 24 IntricatePredicates, 13 DeprecatedPredicates, 6147 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=697, Invalid=21725, Unknown=24, NotChecked=7656, Total=30102 [2022-07-23 05:43:53,334 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 5359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2969 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:53,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 3096 Invalid, 5359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2369 Invalid, 0 Unknown, 2969 Unchecked, 0.9s Time] [2022-07-23 05:43:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 05:43:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-23 05:43:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2022-07-23 05:43:53,337 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2022-07-23 05:43:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:53,337 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2022-07-23 05:43:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-07-23 05:43:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-23 05:43:53,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:53,338 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:53,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:53,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:53,543 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:43:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1005234012, now seen corresponding path program 19 times [2022-07-23 05:43:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817033216] [2022-07-23 05:43:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 190 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:54,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817033216] [2022-07-23 05:43:54,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817033216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:54,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668589981] [2022-07-23 05:43:54,071 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:43:54,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:54,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:54,072 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:54,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-23 05:43:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:54,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-23 05:43:54,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:54,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:55,630 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-23 05:43:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:55,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668589981] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:55,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:55,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 64 [2022-07-23 05:43:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341799020] [2022-07-23 05:43:55,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:55,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-23 05:43:55,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:55,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-23 05:43:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=3793, Unknown=0, NotChecked=0, Total=4160 [2022-07-23 05:43:55,700 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:57,826 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-07-23 05:43:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-23 05:43:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-07-23 05:43:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:57,827 INFO L225 Difference]: With dead ends: 140 [2022-07-23 05:43:57,828 INFO L226 Difference]: Without dead ends: 140 [2022-07-23 05:43:57,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2126, Invalid=8794, Unknown=0, NotChecked=0, Total=10920 [2022-07-23 05:43:57,828 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 773 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:57,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1119 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 05:43:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-23 05:43:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-07-23 05:43:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2022-07-23 05:43:57,830 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 131 [2022-07-23 05:43:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:57,830 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2022-07-23 05:43:57,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2022-07-23 05:43:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-23 05:43:57,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:57,831 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:57,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:58,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-23 05:43:58,049 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:43:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1834780062, now seen corresponding path program 20 times [2022-07-23 05:43:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:58,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154159758] [2022-07-23 05:43:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 50 proven. 720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:59,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154159758] [2022-07-23 05:43:59,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154159758] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:59,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328169878] [2022-07-23 05:43:59,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:43:59,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:59,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:59,721 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:59,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-23 05:43:59,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:43:59,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:59,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 219 conjunts are in the unsatisfiable core [2022-07-23 05:43:59,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:59,932 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 10 treesize of output 8 [2022-07-23 05:44:00,609 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 14 treesize of output 10 [2022-07-23 05:44:00,964 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-23 05:44:01,128 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-23 05:44:01,304 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-23 05:44:01,491 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-23 05:44:01,678 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-23 05:44:01,881 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-23 05:44:02,067 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-23 05:44:02,255 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-23 05:44:02,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:44:02,656 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-23 05:44:02,860 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-23 05:44:03,056 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-23 05:44:03,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:44:03,253 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 19 treesize of output 19 [2022-07-23 05:44:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:03,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:44:07,115 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 16 treesize of output 12 [2022-07-23 05:44:07,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:44:07,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:44:07,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:44:07,126 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 37 treesize of output 37 [2022-07-23 05:44:07,129 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 7 [2022-07-23 05:44:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:08,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328169878] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:44:08,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:44:08,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 46, 46] total 148 [2022-07-23 05:44:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992838514] [2022-07-23 05:44:08,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:44:08,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-07-23 05:44:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:44:08,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-07-23 05:44:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=20515, Unknown=12, NotChecked=0, Total=21756 [2022-07-23 05:44:08,642 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:44:13,977 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2022-07-23 05:44:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-23 05:44:13,978 INFO L78 Accepts]: Start accepts. Automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-07-23 05:44:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:44:13,979 INFO L225 Difference]: With dead ends: 232 [2022-07-23 05:44:13,979 INFO L226 Difference]: Without dead ends: 153 [2022-07-23 05:44:13,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8546 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=2554, Invalid=39664, Unknown=12, NotChecked=0, Total=42230 [2022-07-23 05:44:13,981 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 600 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1726 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:44:13,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2618 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1105 Invalid, 0 Unknown, 1726 Unchecked, 0.4s Time] [2022-07-23 05:44:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-23 05:44:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-23 05:44:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0136054421768708) internal successors, (149), 147 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-23 05:44:13,983 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 137 [2022-07-23 05:44:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:44:13,984 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-23 05:44:13,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-23 05:44:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-23 05:44:13,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:44:13,985 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:44:14,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-23 05:44:14,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-07-23 05:44:14,203 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:44:14,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:44:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1006091491, now seen corresponding path program 21 times [2022-07-23 05:44:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:44:14,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880816021] [2022-07-23 05:44:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:44:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:44:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:44:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:44:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880816021] [2022-07-23 05:44:16,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880816021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:44:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104266732] [2022-07-23 05:44:16,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:44:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:44:16,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:44:16,133 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:44:16,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-23 05:44:20,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-23 05:44:20,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:44:20,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 305 conjunts are in the unsatisfiable core [2022-07-23 05:44:20,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:44:20,285 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 10 treesize of output 8 [2022-07-23 05:44:21,337 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 14 treesize of output 10 [2022-07-23 05:44:21,666 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-23 05:44:21,891 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-23 05:44:22,091 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-23 05:44:22,301 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-23 05:44:22,506 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-23 05:44:22,696 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-23 05:44:22,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:44:23,095 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-23 05:44:23,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:44:23,499 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-23 05:44:23,702 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-23 05:44:23,902 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-23 05:44:24,108 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-23 05:44:24,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:44:24,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:44:24,285 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 17 treesize of output 10 [2022-07-23 05:44:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:24,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:44:24,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:44:24,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:44:24,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1932) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:44:24,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1931) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1930) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:44:24,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1929) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:44:24,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1928) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1927) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-23 05:44:24,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1926) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:44:24,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1925) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:44:24,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1924) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:44:24,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1923) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:44:24,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:44:24,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1922) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:44:24,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-23 05:44:24,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1921) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-23 05:44:24,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-23 05:44:24,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 13)) 0)) is different from false [2022-07-23 05:44:24,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:44:24,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:44:24,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:44:24,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:44:24,476 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 37 treesize of output 37 [2022-07-23 05:44:24,479 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 7 [2022-07-23 05:44:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 519 not checked. [2022-07-23 05:44:25,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104266732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:44:25,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:44:25,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 49, 49] total 152 [2022-07-23 05:44:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088072692] [2022-07-23 05:44:25,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:44:25,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-07-23 05:44:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:44:25,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-07-23 05:44:25,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=14877, Unknown=28, NotChecked=7588, Total=22952 [2022-07-23 05:44:25,613 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:44:29,847 INFO L93 Difference]: Finished difference Result 240 states and 241 transitions. [2022-07-23 05:44:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-23 05:44:29,847 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-07-23 05:44:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:44:29,848 INFO L225 Difference]: With dead ends: 240 [2022-07-23 05:44:29,848 INFO L226 Difference]: Without dead ends: 155 [2022-07-23 05:44:29,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 212 SyntacticMatches, 12 SemanticMatches, 190 ConstructedPredicates, 28 IntricatePredicates, 7 DeprecatedPredicates, 8047 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=735, Invalid=26081, Unknown=28, NotChecked=9828, Total=36672 [2022-07-23 05:44:29,849 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 62 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 6490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3896 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:44:29,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3601 Invalid, 6490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2570 Invalid, 0 Unknown, 3896 Unchecked, 0.9s Time] [2022-07-23 05:44:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-23 05:44:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2022-07-23 05:44:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.0132450331125828) internal successors, (153), 151 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-23 05:44:29,852 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 147 [2022-07-23 05:44:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:44:29,852 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-23 05:44:29,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-23 05:44:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-23 05:44:29,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:44:29,853 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:44:29,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-23 05:44:30,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:44:30,062 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:44:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:44:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1386171046, now seen corresponding path program 22 times [2022-07-23 05:44:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:44:30,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772815818] [2022-07-23 05:44:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:44:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:44:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:44:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 276 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:44:30,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772815818] [2022-07-23 05:44:30,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772815818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:44:30,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617103869] [2022-07-23 05:44:30,771 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:44:30,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:44:30,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:44:30,773 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:44:30,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-23 05:44:32,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:44:32,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:44:32,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 149 conjunts are in the unsatisfiable core [2022-07-23 05:44:32,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:44:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:32,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:44:33,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-23 05:44:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:34,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617103869] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:44:34,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:44:34,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 86 [2022-07-23 05:44:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048069333] [2022-07-23 05:44:34,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:44:34,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-07-23 05:44:34,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:44:34,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-07-23 05:44:34,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=6572, Unknown=0, NotChecked=0, Total=7482 [2022-07-23 05:44:34,318 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:44:36,243 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-23 05:44:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-23 05:44:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2022-07-23 05:44:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:44:36,251 INFO L225 Difference]: With dead ends: 160 [2022-07-23 05:44:36,251 INFO L226 Difference]: Without dead ends: 160 [2022-07-23 05:44:36,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2988, Invalid=11292, Unknown=0, NotChecked=0, Total=14280 [2022-07-23 05:44:36,252 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 796 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:44:36,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1412 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 05:44:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-23 05:44:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-23 05:44:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.0127388535031847) internal successors, (159), 157 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2022-07-23 05:44:36,255 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 151 [2022-07-23 05:44:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:44:36,255 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2022-07-23 05:44:36,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:44:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2022-07-23 05:44:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-23 05:44:36,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:44:36,256 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:44:36,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-23 05:44:36,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:44:36,471 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:44:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:44:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1681679076, now seen corresponding path program 23 times [2022-07-23 05:44:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:44:36,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618892835] [2022-07-23 05:44:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:44:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:44:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:44:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 58 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:44:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:44:38,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618892835] [2022-07-23 05:44:38,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618892835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:44:38,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755489102] [2022-07-23 05:44:38,646 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:44:38,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:44:38,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:44:38,648 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:44:38,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-23 05:45:00,092 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-07-23 05:45:00,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:45:00,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 242 conjunts are in the unsatisfiable core [2022-07-23 05:45:00,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:45:00,134 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 10 treesize of output 8 [2022-07-23 05:45:00,138 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 9 treesize of output 11 [2022-07-23 05:45:01,278 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 14 treesize of output 10 [2022-07-23 05:45:01,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:45:02,008 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 17 treesize of output 19 [2022-07-23 05:45:02,285 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 17 treesize of output 19 [2022-07-23 05:45:02,560 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 17 treesize of output 19 [2022-07-23 05:45:02,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:45:03,143 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 17 treesize of output 19 [2022-07-23 05:45:03,436 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 17 treesize of output 19 [2022-07-23 05:45:03,719 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 17 treesize of output 19 [2022-07-23 05:45:03,999 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 17 treesize of output 19 [2022-07-23 05:45:04,287 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 17 treesize of output 19 [2022-07-23 05:45:04,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:45:04,885 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 17 treesize of output 19 [2022-07-23 05:45:05,188 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 17 treesize of output 19 [2022-07-23 05:45:05,499 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 17 treesize of output 19 [2022-07-23 05:45:05,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:45:05,792 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 20 treesize of output 20 [2022-07-23 05:45:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 325 proven. 713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:45:06,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:45:10,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)))) is different from false [2022-07-23 05:45:10,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0))) is different from false [2022-07-23 05:45:10,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) is different from false [2022-07-23 05:45:10,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:45:10,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:45:10,622 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:45:10,623 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 37 treesize of output 37 [2022-07-23 05:45:10,626 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 7 [2022-07-23 05:45:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 378 proven. 645 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-23 05:45:14,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755489102] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:45:14,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:45:14,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 52, 52] total 168 [2022-07-23 05:45:14,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655885241] [2022-07-23 05:45:14,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:45:14,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2022-07-23 05:45:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:45:14,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2022-07-23 05:45:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=25753, Unknown=20, NotChecked=984, Total=28056 [2022-07-23 05:45:14,039 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:45:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:45:24,309 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2022-07-23 05:45:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-07-23 05:45:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-07-23 05:45:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:45:24,310 INFO L225 Difference]: With dead ends: 264 [2022-07-23 05:45:24,310 INFO L226 Difference]: Without dead ends: 173 [2022-07-23 05:45:24,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 10663 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=3164, Invalid=57098, Unknown=20, NotChecked=1470, Total=61752 [2022-07-23 05:45:24,313 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 627 mSDsluCounter, 4119 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 4184 SdHoareTripleChecker+Invalid, 4717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2637 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 05:45:24,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 4184 Invalid, 4717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2061 Invalid, 0 Unknown, 2637 Unchecked, 0.8s Time] [2022-07-23 05:45:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-23 05:45:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2022-07-23 05:45:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:45:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2022-07-23 05:45:24,317 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 157 [2022-07-23 05:45:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:45:24,317 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2022-07-23 05:45:24,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:45:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2022-07-23 05:45:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-23 05:45:24,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:45:24,318 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:45:24,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-23 05:45:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:45:24,532 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-23 05:45:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:45:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1522236517, now seen corresponding path program 24 times [2022-07-23 05:45:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:45:24,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365064388] [2022-07-23 05:45:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:45:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:45:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:45:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:45:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:45:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365064388] [2022-07-23 05:45:26,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365064388] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:45:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995305347] [2022-07-23 05:45:26,904 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:45:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:45:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:45:26,905 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:45:26,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-23 05:45:54,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-07-23 05:45:54,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:45:54,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 347 conjunts are in the unsatisfiable core [2022-07-23 05:45:54,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:45:54,161 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 10 treesize of output 8 [2022-07-23 05:45:55,406 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 14 treesize of output 10 [2022-07-23 05:45:55,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:45:55,951 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-23 05:45:56,160 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-23 05:45:56,360 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-23 05:45:56,579 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-23 05:45:56,785 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-23 05:45:56,992 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-23 05:45:57,200 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-23 05:45:57,406 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-23 05:45:57,629 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-23 05:45:57,836 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-23 05:45:58,052 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-23 05:45:58,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:45:58,486 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-23 05:45:58,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:45:58,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:45:58,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:45:58,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-23 05:45:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:45:58,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:45:58,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:45:58,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:45:58,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2363) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:45:58,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2362 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2362) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2361) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:45:58,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2360) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:45:58,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2359) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2358) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:58,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2357) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:45:59,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2356) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-23 05:45:59,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2355) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:45:59,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2354) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:45:59,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:45:59,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2353) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-23 05:45:59,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-23 05:45:59,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2352) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-23 05:45:59,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-23 05:45:59,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2351) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-23 05:45:59,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2350) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 15)) 0)) is different from false [2022-07-23 05:45:59,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:45:59,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:45:59,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 05:45:59,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:45:59,116 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 37 treesize of output 37 [2022-07-23 05:45:59,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 11 treesize of output 7 [2022-07-23 05:46:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 689 not checked. [2022-07-23 05:46:00,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995305347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:46:00,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:46:00,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 55, 55] total 172 [2022-07-23 05:46:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561562220] [2022-07-23 05:46:00,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:46:00,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 172 states [2022-07-23 05:46:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:46:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2022-07-23 05:46:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=19037, Unknown=32, NotChecked=9824, Total=29412 [2022-07-23 05:46:00,483 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)