./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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_cstrcpy-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 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:55:22,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:55:22,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:55:22,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:55:22,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:55:22,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:55:22,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:55:22,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:55:22,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:55:22,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:55:22,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:55:22,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:55:22,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:55:22,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:55:22,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:55:22,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:55:22,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:55:22,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:55:22,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:55:22,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:55:22,505 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:55:22,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:55:22,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:55:22,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:55:22,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:55:22,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:55:22,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:55:22,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:55:22,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:55:22,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:55:22,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:55:22,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:55:22,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:55:22,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:55:22,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:55:22,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:55:22,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:55:22,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:55:22,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:55:22,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:55:22,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:55:22,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:55:22,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 16:55:22,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:55:22,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:55:22,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:55:22,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:55:22,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:55:22,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:55:22,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:55:22,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:55:22,541 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:55:22,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:55:22,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:55:22,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:55:22,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:55:22,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:55:22,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:55:22,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:55:22,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:55:22,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:55:22,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:55:22,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:55:22,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:55:22,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 16:55:22,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 16:55:22,544 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 -> 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 [2022-07-21 16:55:22,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:55:22,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:55:22,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:55:22,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:55:22,810 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:55:22,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-07-21 16:55:22,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667009b83/61b418cdf7574d6bbd5c16cbd63419b6/FLAGe92bd334b [2022-07-21 16:55:23,307 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:55:23,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-07-21 16:55:23,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667009b83/61b418cdf7574d6bbd5c16cbd63419b6/FLAGe92bd334b [2022-07-21 16:55:23,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667009b83/61b418cdf7574d6bbd5c16cbd63419b6 [2022-07-21 16:55:23,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:55:23,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:55:23,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:55:23,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:55:23,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:55:23,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14919431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23, skipping insertion in model container [2022-07-21 16:55:23,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:55:23,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:55:23,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:55:23,595 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:55:23,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:55:23,666 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:55:23,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23 WrapperNode [2022-07-21 16:55:23,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:55:23,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:55:23,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:55:23,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:55:23,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,698 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-07-21 16:55:23,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:55:23,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:55:23,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:55:23,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:55:23,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:55:23,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:55:23,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:55:23,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:55:23,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (1/1) ... [2022-07-21 16:55:23,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:55:23,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:23,749 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-21 16:55:23,761 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-21 16:55:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 16:55:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 16:55:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 16:55:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:55:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:55:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:55:23,836 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:55:23,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:55:23,945 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:55:23,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:55:23,949 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 16:55:23,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:55:23 BoogieIcfgContainer [2022-07-21 16:55:23,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:55:23,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:55:23,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:55:23,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:55:23,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:55:23" (1/3) ... [2022-07-21 16:55:23,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f09c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:55:23, skipping insertion in model container [2022-07-21 16:55:23,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:55:23" (2/3) ... [2022-07-21 16:55:23,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f09c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:55:23, skipping insertion in model container [2022-07-21 16:55:23,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:55:23" (3/3) ... [2022-07-21 16:55:23,955 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2022-07-21 16:55:23,977 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:55:23,978 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-21 16:55:24,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:55:24,012 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@38fa2cb0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6275c9ed [2022-07-21 16:55:24,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-21 16:55:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 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-21 16:55:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:55:24,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,025 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-21 16:55:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632545499] [2022-07-21 16:55:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,219 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-21 16:55:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632545499] [2022-07-21 16:55:24,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632545499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714157080] [2022-07-21 16:55:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:24,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:24,259 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-21 16:55:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,317 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-21 16:55:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-07-21 16:55:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,325 INFO L225 Difference]: With dead ends: 34 [2022-07-21 16:55:24,325 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 16:55:24,326 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-21 16:55:24,329 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 16:55:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-21 16:55:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 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-21 16:55:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 16:55:24,356 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-21 16:55:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,356 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 16:55:24,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-21 16:55:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 16:55:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:55:24,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 16:55:24,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,362 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-21 16:55:24,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833597639] [2022-07-21 16:55:24,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,402 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-21 16:55:24,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833597639] [2022-07-21 16:55:24,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833597639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:55:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788405127] [2022-07-21 16:55:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:55:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:55:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:55:24,406 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:55:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,434 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-21 16:55:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:55:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-21 16:55:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,437 INFO L225 Difference]: With dead ends: 29 [2022-07-21 16:55:24,437 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 16:55:24,441 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-21 16:55:24,443 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 16:55:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-21 16:55:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 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-21 16:55:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-21 16:55:24,451 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-21 16:55:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,451 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-21 16:55:24,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:55:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-21 16:55:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:24,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 16:55:24,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-21 16:55:24,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883623076] [2022-07-21 16:55:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,510 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-21 16:55:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883623076] [2022-07-21 16:55:24,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883623076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:55:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075457626] [2022-07-21 16:55:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:55:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:55:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:55:24,515 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. 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-21 16:55:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,537 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-21 16:55:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:55:24,537 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-21 16:55:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,538 INFO L225 Difference]: With dead ends: 25 [2022-07-21 16:55:24,538 INFO L226 Difference]: Without dead ends: 25 [2022-07-21 16:55:24,538 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-21 16:55:24,541 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-21 16:55:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-21 16:55:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 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-21 16:55:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-21 16:55:24,544 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-07-21 16:55:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,544 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-21 16:55:24,544 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-21 16:55:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-21 16:55:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:24,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 16:55:24,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2022-07-21 16:55:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777797250] [2022-07-21 16:55:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,594 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-21 16:55:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777797250] [2022-07-21 16:55:24,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777797250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:55:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84321168] [2022-07-21 16:55:24,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:24,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:24,597 INFO L87 Difference]: Start difference. First operand 25 states and 28 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-21 16:55:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,614 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-21 16:55:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:24,614 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-21 16:55:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,615 INFO L225 Difference]: With dead ends: 24 [2022-07-21 16:55:24,615 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 16:55:24,615 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-21 16:55:24,616 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 16:55:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-21 16:55:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 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-21 16:55:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-21 16:55:24,619 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2022-07-21 16:55:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,619 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-21 16:55:24,620 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-21 16:55:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-21 16:55:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:24,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 16:55:24,621 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-21 16:55:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857194530] [2022-07-21 16:55:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,653 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-21 16:55:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857194530] [2022-07-21 16:55:24,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857194530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:24,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150355558] [2022-07-21 16:55:24,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:24,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:24,656 INFO L87 Difference]: Start difference. First operand 24 states and 27 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-21 16:55:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,667 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-21 16:55:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:24,668 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-21 16:55:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,668 INFO L225 Difference]: With dead ends: 40 [2022-07-21 16:55:24,668 INFO L226 Difference]: Without dead ends: 40 [2022-07-21 16:55:24,669 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-21 16:55:24,669 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 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-21 16:55:24,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-21 16:55:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2022-07-21 16:55:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 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-21 16:55:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-21 16:55:24,673 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-21 16:55:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,673 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-21 16:55:24,673 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-21 16:55:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-21 16:55:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:55:24,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 16:55:24,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2022-07-21 16:55:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495924307] [2022-07-21 16:55:24,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,711 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-21 16:55:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495924307] [2022-07-21 16:55:24,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495924307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:55:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419295085] [2022-07-21 16:55:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:24,714 INFO L87 Difference]: Start difference. First operand 26 states and 29 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-21 16:55:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,757 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-21 16:55:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:24,757 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-21 16:55:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,759 INFO L225 Difference]: With dead ends: 44 [2022-07-21 16:55:24,759 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 16:55:24,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 16:55:24,761 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 16:55:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-21 16:55:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 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-21 16:55:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 16:55:24,766 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2022-07-21 16:55:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,766 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 16:55:24,766 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-21 16:55:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 16:55:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 16:55:24,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 16:55:24,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -530059845, now seen corresponding path program 1 times [2022-07-21 16:55:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648272630] [2022-07-21 16:55:24,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,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-21 16:55:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648272630] [2022-07-21 16:55:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648272630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:55:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870558511] [2022-07-21 16:55:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:24,797 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-21 16:55:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,819 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-21 16:55:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:24,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-07-21 16:55:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,820 INFO L225 Difference]: With dead ends: 27 [2022-07-21 16:55:24,820 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 16:55:24,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 16:55:24,821 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 16:55:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-21 16:55:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 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-21 16:55:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-21 16:55:24,823 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2022-07-21 16:55:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,824 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-21 16:55:24,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-21 16:55:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-21 16:55:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 16:55:24,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 16:55:24,825 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,826 INFO L85 PathProgramCache]: Analyzing trace with hash -530059844, now seen corresponding path program 1 times [2022-07-21 16:55:24,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681731248] [2022-07-21 16:55:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,886 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-21 16:55:24,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681731248] [2022-07-21 16:55:24,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681731248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:55:24,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206711783] [2022-07-21 16:55:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:55:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:55:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:55:24,888 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-21 16:55:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:24,932 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-07-21 16:55:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:55:24,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-07-21 16:55:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:24,935 INFO L225 Difference]: With dead ends: 37 [2022-07-21 16:55:24,935 INFO L226 Difference]: Without dead ends: 37 [2022-07-21 16:55:24,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:55:24,937 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:24,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 36 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-21 16:55:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-07-21 16:55:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 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-21 16:55:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 16:55:24,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2022-07-21 16:55:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:24,943 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 16:55:24,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-21 16:55:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 16:55:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:55:24,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:24,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:24,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 16:55:24,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash 748014006, now seen corresponding path program 1 times [2022-07-21 16:55:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:24,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283396299] [2022-07-21 16:55:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:24,996 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-21 16:55:24,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:24,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283396299] [2022-07-21 16:55:24,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283396299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:24,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:24,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083788481] [2022-07-21 16:55:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:55:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:55:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:55:24,998 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-21 16:55:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:25,016 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-21 16:55:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-07-21 16:55:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:25,017 INFO L225 Difference]: With dead ends: 27 [2022-07-21 16:55:25,017 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 16:55:25,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-21 16:55:25,018 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:25,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 30 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 16:55:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-21 16:55:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 26 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-21 16:55:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-21 16:55:25,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2022-07-21 16:55:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:25,020 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-21 16:55:25,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-21 16:55:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-21 16:55:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:55:25,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:25,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:25,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 16:55:25,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash 748014007, now seen corresponding path program 1 times [2022-07-21 16:55:25,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:25,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498118864] [2022-07-21 16:55:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:25,087 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-21 16:55:25,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:25,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498118864] [2022-07-21 16:55:25,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498118864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:25,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:25,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923348377] [2022-07-21 16:55:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:25,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:55:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:25,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:55:25,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:55:25,090 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-21 16:55:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:25,118 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-07-21 16:55:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:55:25,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-07-21 16:55:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:25,119 INFO L225 Difference]: With dead ends: 34 [2022-07-21 16:55:25,119 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 16:55:25,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:55:25,120 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:25,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 36 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 16:55:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-21 16:55:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 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-21 16:55:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 16:55:25,121 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2022-07-21 16:55:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:25,121 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 16:55:25,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-21 16:55:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 16:55:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:55:25,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:25,122 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:25,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 16:55:25,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:25,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2022-07-21 16:55:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:25,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028008781] [2022-07-21 16:55:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:55:25,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:25,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028008781] [2022-07-21 16:55:25,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028008781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:25,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:25,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:55:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514853656] [2022-07-21 16:55:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:25,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:25,148 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-21 16:55:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:25,165 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-07-21 16:55:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-21 16:55:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:25,166 INFO L225 Difference]: With dead ends: 47 [2022-07-21 16:55:25,167 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 16:55:25,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-21 16:55:25,167 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:25,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 16:55:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2022-07-21 16:55:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 28 states have internal predecessors, (34), 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-21 16:55:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-21 16:55:25,170 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 11 [2022-07-21 16:55:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:25,170 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-21 16:55:25,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-21 16:55:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-21 16:55:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:55:25,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:25,171 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:25,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 16:55:25,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-21 16:55:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:25,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475874912] [2022-07-21 16:55:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:25,216 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-21 16:55:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:25,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475874912] [2022-07-21 16:55:25,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475874912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:25,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769165754] [2022-07-21 16:55:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:25,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:25,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:25,235 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-21 16:55:25,247 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-21 16:55:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:25,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 16:55:25,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:25,388 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:25,389 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-21 16:55:25,476 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-21 16:55:25,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:25,593 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-21 16:55:25,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769165754] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:25,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:25,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-21 16:55:25,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516568746] [2022-07-21 16:55:25,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:25,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 16:55:25,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:25,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 16:55:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:55:25,595 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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-21 16:55:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:25,701 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-07-21 16:55:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:55:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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-21 16:55:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:25,702 INFO L225 Difference]: With dead ends: 59 [2022-07-21 16:55:25,702 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 16:55:25,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:55:25,703 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 86 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:25,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 86 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 16:55:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 26. [2022-07-21 16:55:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 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-21 16:55:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-21 16:55:25,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2022-07-21 16:55:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:25,706 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-21 16:55:25,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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-21 16:55:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-21 16:55:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 16:55:25,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:25,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:25,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 16:55:25,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 16:55:25,924 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1794944983, now seen corresponding path program 1 times [2022-07-21 16:55:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:25,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200034406] [2022-07-21 16:55:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:25,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200034406] [2022-07-21 16:55:25,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200034406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:25,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:25,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 16:55:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643767446] [2022-07-21 16:55:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:25,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:55:25,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:25,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:55:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:55:25,990 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-21 16:55:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:26,045 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-07-21 16:55:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:55:26,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-07-21 16:55:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:26,046 INFO L225 Difference]: With dead ends: 37 [2022-07-21 16:55:26,046 INFO L226 Difference]: Without dead ends: 37 [2022-07-21 16:55:26,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-21 16:55:26,047 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:26,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 81 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-21 16:55:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-21 16:55:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 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-21 16:55:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-21 16:55:26,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2022-07-21 16:55:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:26,051 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-21 16:55:26,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-21 16:55:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-21 16:55:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 16:55:26,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:26,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:26,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 16:55:26,052 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:26,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1401917973, now seen corresponding path program 1 times [2022-07-21 16:55:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:26,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153821395] [2022-07-21 16:55:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:26,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153821395] [2022-07-21 16:55:26,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153821395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:26,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:26,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 16:55:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112576039] [2022-07-21 16:55:26,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:26,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:55:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:55:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:55:26,128 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-21 16:55:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:26,187 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-07-21 16:55:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:55:26,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-07-21 16:55:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:26,187 INFO L225 Difference]: With dead ends: 49 [2022-07-21 16:55:26,188 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 16:55:26,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 16:55:26,188 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:26,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 16:55:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-07-21 16:55:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 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-21 16:55:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-21 16:55:26,190 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2022-07-21 16:55:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:26,191 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-21 16:55:26,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-21 16:55:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-07-21 16:55:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 16:55:26,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:26,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 16:55:26,192 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2102982551, now seen corresponding path program 1 times [2022-07-21 16:55:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:26,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902400305] [2022-07-21 16:55:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:26,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902400305] [2022-07-21 16:55:26,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902400305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:26,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:26,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 16:55:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527651575] [2022-07-21 16:55:26,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:26,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:55:26,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:55:26,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:55:26,253 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-21 16:55:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:26,404 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-21 16:55:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:55:26,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-07-21 16:55:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:26,405 INFO L225 Difference]: With dead ends: 44 [2022-07-21 16:55:26,405 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 16:55:26,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 16:55:26,406 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:26,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 85 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 16:55:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-07-21 16:55:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-21 16:55:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-21 16:55:26,408 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2022-07-21 16:55:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:26,408 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-21 16:55:26,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-21 16:55:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-07-21 16:55:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:55:26,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:26,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 16:55:26,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:26,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash -191335553, now seen corresponding path program 1 times [2022-07-21 16:55:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:26,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179700916] [2022-07-21 16:55:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,460 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-21 16:55:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:26,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179700916] [2022-07-21 16:55:26,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179700916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:55:26,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:55:26,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:55:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226981059] [2022-07-21 16:55:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:55:26,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:55:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:55:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:55:26,462 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-21 16:55:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:26,473 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-21 16:55:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:55:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-07-21 16:55:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:26,475 INFO L225 Difference]: With dead ends: 31 [2022-07-21 16:55:26,475 INFO L226 Difference]: Without dead ends: 20 [2022-07-21 16:55:26,475 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-21 16:55:26,475 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:26,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:55:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-21 16:55:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-21 16:55:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-21 16:55:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-07-21 16:55:26,479 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-07-21 16:55:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:26,479 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-07-21 16:55:26,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-21 16:55:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-07-21 16:55:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 16:55:26,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:26,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:26,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 16:55:26,480 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:26,480 INFO L85 PathProgramCache]: Analyzing trace with hash 70337178, now seen corresponding path program 1 times [2022-07-21 16:55:26,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:26,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368493494] [2022-07-21 16:55:26,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,551 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-21 16:55:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:26,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368493494] [2022-07-21 16:55:26,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368493494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:26,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291445578] [2022-07-21 16:55:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:26,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:26,554 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-21 16:55:26,590 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-21 16:55:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:26,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 16:55:26,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:26,680 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-21 16:55:26,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:26,749 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-21 16:55:26,764 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-21 16:55:26,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291445578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:26,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:26,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-21 16:55:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614009911] [2022-07-21 16:55:26,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:26,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 16:55:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:26,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 16:55:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-21 16:55:26,766 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 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-21 16:55:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:26,865 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-21 16:55:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:55:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 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-21 16:55:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:26,866 INFO L225 Difference]: With dead ends: 30 [2022-07-21 16:55:26,866 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 16:55:26,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-21 16:55:26,867 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:26,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 45 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 16:55:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-07-21 16:55:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 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-21 16:55:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-21 16:55:26,869 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2022-07-21 16:55:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:26,869 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-21 16:55:26,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 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-21 16:55:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-21 16:55:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:55:26,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:26,870 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:26,888 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-21 16:55:27,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 16:55:27,076 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2114514791, now seen corresponding path program 1 times [2022-07-21 16:55:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222246246] [2022-07-21 16:55:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:27,193 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-21 16:55:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:27,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222246246] [2022-07-21 16:55:27,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222246246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289733206] [2022-07-21 16:55:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:27,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:27,195 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-21 16:55:27,196 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-21 16:55:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:27,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 16:55:27,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:27,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:27,252 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-21 16:55:27,255 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-21 16:55:27,321 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-21 16:55:27,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:27,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289733206] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:27,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:27,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-07-21 16:55:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979581198] [2022-07-21 16:55:27,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:27,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 16:55:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:27,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 16:55:27,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-21 16:55:27,439 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 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-21 16:55:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:27,571 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-21 16:55:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:55:27,571 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 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) Word has length 18 [2022-07-21 16:55:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:27,572 INFO L225 Difference]: With dead ends: 29 [2022-07-21 16:55:27,572 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 16:55:27,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-07-21 16:55:27,572 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:27,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 48 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 16:55:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-07-21 16:55:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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-21 16:55:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-21 16:55:27,574 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-21 16:55:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:27,574 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-21 16:55:27,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 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-21 16:55:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-21 16:55:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 16:55:27,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:27,575 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:27,593 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-21 16:55:27,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 16:55:27,775 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash 775185845, now seen corresponding path program 2 times [2022-07-21 16:55:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:27,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036529596] [2022-07-21 16:55:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036529596] [2022-07-21 16:55:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036529596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321821219] [2022-07-21 16:55:27,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:27,964 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-21 16:55:27,966 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-21 16:55:28,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:28,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:28,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 16:55:28,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:28,029 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-21 16:55:28,066 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-21 16:55:28,190 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-21 16:55:28,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:28,279 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 18 treesize of output 18 [2022-07-21 16:55:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:28,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:28,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_16| Int) (v_ArrVal_188 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_16|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_16|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_16| 1)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_16| 3) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-21 16:55:28,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:28,637 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-21 16:55:28,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:28,646 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-21 16:55:28,651 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-21 16:55:28,655 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-21 16:55:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:28,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321821219] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:28,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:28,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-07-21 16:55:28,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981014820] [2022-07-21 16:55:28,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:28,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 16:55:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:28,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 16:55:28,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=769, Unknown=2, NotChecked=56, Total=930 [2022-07-21 16:55:28,760 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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-21 16:55:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:29,107 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-07-21 16:55:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 16:55:29,108 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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) Word has length 21 [2022-07-21 16:55:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:29,108 INFO L225 Difference]: With dead ends: 47 [2022-07-21 16:55:29,108 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 16:55:29,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=1440, Unknown=2, NotChecked=78, Total=1722 [2022-07-21 16:55:29,109 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:29,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 114 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2022-07-21 16:55:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 16:55:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-07-21 16:55:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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-21 16:55:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-21 16:55:29,111 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2022-07-21 16:55:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:29,111 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-21 16:55:29,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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-21 16:55:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-21 16:55:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 16:55:29,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:29,111 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:29,130 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-21 16:55:29,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:29,319 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:29,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1518290629, now seen corresponding path program 2 times [2022-07-21 16:55:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:29,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366160741] [2022-07-21 16:55:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:29,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366160741] [2022-07-21 16:55:29,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366160741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:29,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697261680] [2022-07-21 16:55:29,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:29,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:29,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:29,424 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-21 16:55:29,436 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-21 16:55:29,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:29,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:29,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 16:55:29,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:29,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:29,503 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-21 16:55:29,509 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-21 16:55:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:29,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:29,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697261680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:29,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:29,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-07-21 16:55:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625138893] [2022-07-21 16:55:29,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:29,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 16:55:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:29,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 16:55:29,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-07-21 16:55:29,828 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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-21 16:55:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:30,002 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-21 16:55:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:55:30,002 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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) Word has length 26 [2022-07-21 16:55:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:30,002 INFO L225 Difference]: With dead ends: 34 [2022-07-21 16:55:30,002 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 16:55:30,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-07-21 16:55:30,003 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 86 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:30,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 50 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 16:55:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-21 16:55:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 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-21 16:55:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-21 16:55:30,005 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2022-07-21 16:55:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:30,005 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-21 16:55:30,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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-21 16:55:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-21 16:55:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 16:55:30,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:30,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:30,023 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-21 16:55:30,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:30,215 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1095540269, now seen corresponding path program 3 times [2022-07-21 16:55:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:30,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062617712] [2022-07-21 16:55:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:30,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062617712] [2022-07-21 16:55:30,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062617712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:30,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144149329] [2022-07-21 16:55:30,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:55:30,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:30,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:30,356 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-21 16:55:30,357 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-21 16:55:30,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 16:55:30,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:30,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 16:55:30,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:30,432 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-21 16:55:30,570 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-21 16:55:30,638 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-21 16:55:30,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-21 16:55:30,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:55:30,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:30,760 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-21 16:55:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:30,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:30,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:30,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:55:30,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:30,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:30,808 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-21 16:55:30,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:30,814 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-21 16:55:30,817 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-21 16:55:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-21 16:55:30,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144149329] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:30,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:30,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2022-07-21 16:55:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797991536] [2022-07-21 16:55:30,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:30,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 16:55:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 16:55:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=668, Unknown=3, NotChecked=162, Total=930 [2022-07-21 16:55:30,991 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 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-21 16:55:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:31,139 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-21 16:55:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 16:55:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 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) Word has length 29 [2022-07-21 16:55:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:31,140 INFO L225 Difference]: With dead ends: 52 [2022-07-21 16:55:31,140 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 16:55:31,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=872, Unknown=3, NotChecked=186, Total=1190 [2022-07-21 16:55:31,141 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:31,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 166 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2022-07-21 16:55:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 16:55:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-21 16:55:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 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-21 16:55:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-21 16:55:31,142 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2022-07-21 16:55:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:31,142 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-21 16:55:31,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 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-21 16:55:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-21 16:55:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 16:55:31,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:31,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:31,170 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-21 16:55:31,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:31,352 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1267943126, now seen corresponding path program 4 times [2022-07-21 16:55:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652340464] [2022-07-21 16:55:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:31,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:31,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652340464] [2022-07-21 16:55:31,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652340464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:31,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085332223] [2022-07-21 16:55:31,467 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:55:31,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:31,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:31,468 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-21 16:55:31,470 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-21 16:55:31,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:55:31,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:31,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 16:55:31,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:31,543 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-21 16:55:31,545 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-21 16:55:31,672 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 16 treesize of output 12 [2022-07-21 16:55:31,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:31,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:31,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:31,851 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-21 16:55:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:31,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:32,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:32,257 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-21 16:55:32,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:32,264 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-21 16:55:32,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:55:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:32,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085332223] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:32,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:32,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 35 [2022-07-21 16:55:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349048365] [2022-07-21 16:55:32,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:32,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-21 16:55:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-21 16:55:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1098, Unknown=1, NotChecked=0, Total=1260 [2022-07-21 16:55:32,541 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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-21 16:55:32,949 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|))) (and (<= 2 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (or (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3) .cse0) (<= 0 .cse1))) (or (not (= |c_ULTIMATE.start_cstrcpy_~from#1.offset| (+ .cse0 (- 1)))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (<= .cse1 .cse0) (<= 3 .cse0) (= (+ (- 1) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 1))) is different from false [2022-07-21 16:55:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:33,147 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-07-21 16:55:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 16:55:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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 33 [2022-07-21 16:55:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:33,149 INFO L225 Difference]: With dead ends: 48 [2022-07-21 16:55:33,149 INFO L226 Difference]: Without dead ends: 48 [2022-07-21 16:55:33,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=379, Invalid=1975, Unknown=2, NotChecked=94, Total=2450 [2022-07-21 16:55:33,151 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:33,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 186 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 426 Invalid, 0 Unknown, 106 Unchecked, 0.2s Time] [2022-07-21 16:55:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-21 16:55:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-07-21 16:55:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 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-21 16:55:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-07-21 16:55:33,155 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 33 [2022-07-21 16:55:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:33,155 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-07-21 16:55:33,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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-21 16:55:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-07-21 16:55:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 16:55:33,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:33,156 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:33,184 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-21 16:55:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:33,375 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash 651531229, now seen corresponding path program 3 times [2022-07-21 16:55:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542679662] [2022-07-21 16:55:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:33,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:33,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542679662] [2022-07-21 16:55:33,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542679662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:33,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8474201] [2022-07-21 16:55:33,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:55:33,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:33,495 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-21 16:55:33,497 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-21 16:55:33,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 16:55:33,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:33,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 16:55:33,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:33,576 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:33,576 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-21 16:55:33,587 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-21 16:55:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:33,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:34,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8474201] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:34,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:34,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-07-21 16:55:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864070260] [2022-07-21 16:55:34,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:34,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 16:55:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:34,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 16:55:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2022-07-21 16:55:34,111 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 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-21 16:55:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:34,436 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-21 16:55:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 16:55:34,437 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 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 34 [2022-07-21 16:55:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:34,437 INFO L225 Difference]: With dead ends: 43 [2022-07-21 16:55:34,437 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 16:55:34,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 16:55:34,438 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 135 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:34,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 103 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 16:55:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-21 16:55:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 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-21 16:55:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-21 16:55:34,440 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-21 16:55:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:34,440 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-21 16:55:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 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-21 16:55:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-21 16:55:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 16:55:34,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:34,440 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:34,465 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-21 16:55:34,641 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,SelfDestructingSolverStorable22 [2022-07-21 16:55:34,641 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash -671378910, now seen corresponding path program 4 times [2022-07-21 16:55:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:34,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044929038] [2022-07-21 16:55:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044929038] [2022-07-21 16:55:34,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044929038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:34,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152075456] [2022-07-21 16:55:34,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:55:34,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:34,748 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-21 16:55:34,749 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-21 16:55:34,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:55:34,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:34,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 16:55:34,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:34,827 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:34,827 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-21 16:55:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:35,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:35,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152075456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:35,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:35,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 28 [2022-07-21 16:55:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356497992] [2022-07-21 16:55:35,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:35,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 16:55:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:35,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 16:55:35,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-07-21 16:55:35,164 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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-21 16:55:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:35,433 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-07-21 16:55:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 16:55:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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) Word has length 38 [2022-07-21 16:55:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:35,434 INFO L225 Difference]: With dead ends: 69 [2022-07-21 16:55:35,434 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 16:55:35,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 16:55:35,434 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:35,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 88 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 16:55:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-21 16:55:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 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-21 16:55:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-21 16:55:35,436 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 38 [2022-07-21 16:55:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:35,436 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-21 16:55:35,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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-21 16:55:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-21 16:55:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 16:55:35,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:35,437 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:35,457 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-21 16:55:35,637 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,SelfDestructingSolverStorable23 [2022-07-21 16:55:35,637 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -452353921, now seen corresponding path program 5 times [2022-07-21 16:55:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:35,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899445497] [2022-07-21 16:55:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:35,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:35,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899445497] [2022-07-21 16:55:35,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899445497] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:35,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997795141] [2022-07-21 16:55:35,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:55:35,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:35,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:35,777 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-21 16:55:35,778 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-21 16:55:35,864 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-21 16:55:35,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:35,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 16:55:35,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:35,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:35,874 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-21 16:55:35,876 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-21 16:55:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:36,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:36,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997795141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:36,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:36,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-07-21 16:55:36,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747777162] [2022-07-21 16:55:36,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:36,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 16:55:36,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:36,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 16:55:36,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 16:55:36,437 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 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-21 16:55:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:36,697 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-07-21 16:55:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 16:55:36,698 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 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 42 [2022-07-21 16:55:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:36,698 INFO L225 Difference]: With dead ends: 50 [2022-07-21 16:55:36,698 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 16:55:36,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 16:55:36,700 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 137 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:36,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 135 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:55:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 16:55:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-21 16:55:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 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-21 16:55:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-07-21 16:55:36,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2022-07-21 16:55:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:36,703 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-07-21 16:55:36,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 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-21 16:55:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-07-21 16:55:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 16:55:36,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:36,708 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:36,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-21 16:55:36,925 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,SelfDestructingSolverStorable24 [2022-07-21 16:55:36,926 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1531708431, now seen corresponding path program 5 times [2022-07-21 16:55:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:36,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267970776] [2022-07-21 16:55:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:37,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267970776] [2022-07-21 16:55:37,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267970776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:37,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136129789] [2022-07-21 16:55:37,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:55:37,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:37,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:37,138 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-21 16:55:37,139 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-21 16:55:37,252 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-21 16:55:37,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:37,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 16:55:37,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:37,260 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-21 16:55:37,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 16:55:37,485 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-21 16:55:37,524 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-21 16:55:37,539 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-21 16:55:37,549 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-21 16:55:37,570 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-21 16:55:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:37,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:37,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:37,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:55:37,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:55:37,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:55:37,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:55:37,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:37,612 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-21 16:55:37,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:37,616 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-21 16:55:37,619 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-21 16:55:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-07-21 16:55:37,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136129789] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:37,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:37,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 33 [2022-07-21 16:55:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022211978] [2022-07-21 16:55:37,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:37,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 16:55:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 16:55:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=684, Unknown=5, NotChecked=280, Total=1056 [2022-07-21 16:55:37,766 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 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-21 16:55:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:38,146 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-21 16:55:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 16:55:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 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) Word has length 45 [2022-07-21 16:55:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:38,147 INFO L225 Difference]: With dead ends: 76 [2022-07-21 16:55:38,147 INFO L226 Difference]: Without dead ends: 55 [2022-07-21 16:55:38,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=1070, Unknown=5, NotChecked=350, Total=1560 [2022-07-21 16:55:38,148 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:38,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 268 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 465 Invalid, 0 Unknown, 286 Unchecked, 0.2s Time] [2022-07-21 16:55:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-21 16:55:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-07-21 16:55:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 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-21 16:55:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-07-21 16:55:38,149 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2022-07-21 16:55:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:38,150 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-07-21 16:55:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 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-21 16:55:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-07-21 16:55:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 16:55:38,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:38,152 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:38,180 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-21 16:55:38,352 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,SelfDestructingSolverStorable25 [2022-07-21 16:55:38,353 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 801080082, now seen corresponding path program 6 times [2022-07-21 16:55:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:38,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510246700] [2022-07-21 16:55:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510246700] [2022-07-21 16:55:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510246700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642443380] [2022-07-21 16:55:38,557 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:55:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:38,559 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-21 16:55:38,581 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-21 16:55:38,688 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-21 16:55:38,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:38,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 16:55:38,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:38,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:39,139 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 7 treesize of output 5 [2022-07-21 16:55:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:39,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642443380] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:39,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:39,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 35 [2022-07-21 16:55:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876522245] [2022-07-21 16:55:39,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-21 16:55:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-21 16:55:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 16:55:39,171 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 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-21 16:55:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:39,584 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-21 16:55:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 16:55:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 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 49 [2022-07-21 16:55:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:39,584 INFO L225 Difference]: With dead ends: 59 [2022-07-21 16:55:39,584 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 16:55:39,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2022-07-21 16:55:39,585 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 245 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:39,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 182 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 16:55:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-07-21 16:55:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 54 states have internal predecessors, (56), 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-21 16:55:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-21 16:55:39,587 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2022-07-21 16:55:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:39,587 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-21 16:55:39,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 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-21 16:55:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-21 16:55:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 16:55:39,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:39,588 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:39,605 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-21 16:55:39,788 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,SelfDestructingSolverStorable26 [2022-07-21 16:55:39,788 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -936321247, now seen corresponding path program 6 times [2022-07-21 16:55:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:39,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734768130] [2022-07-21 16:55:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:39,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734768130] [2022-07-21 16:55:39,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734768130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:39,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338624888] [2022-07-21 16:55:39,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:55:39,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:39,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:39,946 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-21 16:55:39,947 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-21 16:55:40,071 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-21 16:55:40,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:40,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 16:55:40,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:40,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:40,086 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-21 16:55:40,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-21 16:55:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:40,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:40,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338624888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:40,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:40,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2022-07-21 16:55:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140453498] [2022-07-21 16:55:40,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:40,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 16:55:40,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:40,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 16:55:40,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2022-07-21 16:55:40,879 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 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-21 16:55:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:41,386 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-21 16:55:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 16:55:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 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 50 [2022-07-21 16:55:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:41,387 INFO L225 Difference]: With dead ends: 58 [2022-07-21 16:55:41,387 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 16:55:41,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2022-07-21 16:55:41,388 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 167 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:41,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 158 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 16:55:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-07-21 16:55:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 55 states have internal predecessors, (57), 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-21 16:55:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-07-21 16:55:41,390 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2022-07-21 16:55:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:41,390 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-07-21 16:55:41,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 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-21 16:55:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-07-21 16:55:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 16:55:41,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:41,390 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:41,414 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-21 16:55:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 16:55:41,603 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:41,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1866312237, now seen corresponding path program 7 times [2022-07-21 16:55:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:41,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937507886] [2022-07-21 16:55:41,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:41,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:41,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937507886] [2022-07-21 16:55:41,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937507886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:41,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685952141] [2022-07-21 16:55:41,906 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:55:41,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:41,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:41,907 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-21 16:55:41,908 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-21 16:55:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:41,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-21 16:55:42,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:42,008 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-21 16:55:42,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 16:55:42,179 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-21 16:55:42,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:42,228 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-21 16:55:42,236 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-21 16:55:42,244 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-21 16:55:42,259 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-21 16:55:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:42,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:42,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:42,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:55:42,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:55:42,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:55:42,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:55:42,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:42,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:42,320 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-21 16:55:42,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:42,323 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-21 16:55:42,327 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-21 16:55:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2022-07-21 16:55:42,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685952141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:42,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:42,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 37 [2022-07-21 16:55:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094985533] [2022-07-21 16:55:42,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:42,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 16:55:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:42,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 16:55:42,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=852, Unknown=6, NotChecked=378, Total=1332 [2022-07-21 16:55:42,452 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 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-21 16:55:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:42,981 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2022-07-21 16:55:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:55:42,982 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 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) Word has length 53 [2022-07-21 16:55:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:42,982 INFO L225 Difference]: With dead ends: 88 [2022-07-21 16:55:42,982 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 16:55:42,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1351, Unknown=6, NotChecked=474, Total=1980 [2022-07-21 16:55:42,987 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:42,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 348 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 691 Invalid, 0 Unknown, 339 Unchecked, 0.3s Time] [2022-07-21 16:55:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 16:55:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-21 16:55:42,990 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-21 16:55:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-21 16:55:42,991 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 53 [2022-07-21 16:55:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:42,991 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-21 16:55:42,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 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-21 16:55:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-21 16:55:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 16:55:42,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:42,992 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:43,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:43,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:43,209 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -795904464, now seen corresponding path program 8 times [2022-07-21 16:55:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:43,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906842538] [2022-07-21 16:55:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 28 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:43,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:43,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906842538] [2022-07-21 16:55:43,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906842538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:43,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149783017] [2022-07-21 16:55:43,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:43,469 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-21 16:55:43,470 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-21 16:55:43,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:43,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:43,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 16:55:43,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:43,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:43,959 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-21 16:55:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:43,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149783017] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:43,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:43,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 35 [2022-07-21 16:55:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475062851] [2022-07-21 16:55:43,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:43,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-21 16:55:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-21 16:55:43,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 16:55:43,994 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 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-21 16:55:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:44,348 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2022-07-21 16:55:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 16:55:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 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-21 16:55:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:44,349 INFO L225 Difference]: With dead ends: 67 [2022-07-21 16:55:44,349 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 16:55:44,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2022-07-21 16:55:44,350 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 308 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:44,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 248 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 16:55:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-07-21 16:55:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 62 states have internal predecessors, (64), 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-21 16:55:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-21 16:55:44,352 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2022-07-21 16:55:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:44,352 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-21 16:55:44,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 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-21 16:55:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-21 16:55:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 16:55:44,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:44,352 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:44,378 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-21 16:55:44,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:44,553 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1096765379, now seen corresponding path program 7 times [2022-07-21 16:55:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:44,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928590218] [2022-07-21 16:55:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928590218] [2022-07-21 16:55:44,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928590218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283809045] [2022-07-21 16:55:44,735 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:55:44,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:44,736 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-21 16:55:44,738 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-21 16:55:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:44,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 16:55:44,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:44,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:44,843 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-21 16:55:44,849 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-21 16:55:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:45,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:45,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283809045] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:45,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:45,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2022-07-21 16:55:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398649815] [2022-07-21 16:55:45,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:45,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 16:55:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 16:55:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2022-07-21 16:55:45,724 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 states have internal predecessors, (165), 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-21 16:55:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:46,212 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-07-21 16:55:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 16:55:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 states have internal predecessors, (165), 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 58 [2022-07-21 16:55:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:46,214 INFO L225 Difference]: With dead ends: 66 [2022-07-21 16:55:46,214 INFO L226 Difference]: Without dead ends: 66 [2022-07-21 16:55:46,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=627, Invalid=2795, Unknown=0, NotChecked=0, Total=3422 [2022-07-21 16:55:46,216 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 285 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:46,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 228 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-21 16:55:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-21 16:55:46,218 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-21 16:55:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-21 16:55:46,219 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2022-07-21 16:55:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:46,219 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-21 16:55:46,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 states have internal predecessors, (165), 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-21 16:55:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-21 16:55:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 16:55:46,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:46,220 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:46,247 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-21 16:55:46,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:46,444 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1921179211, now seen corresponding path program 9 times [2022-07-21 16:55:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:46,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151687917] [2022-07-21 16:55:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:46,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151687917] [2022-07-21 16:55:46,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151687917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:46,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418824917] [2022-07-21 16:55:46,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:55:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:46,730 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-21 16:55:46,742 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-21 16:55:47,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-21 16:55:47,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:47,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 16:55:47,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:47,023 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-21 16:55:47,191 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-21 16:55:47,243 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-21 16:55:47,293 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-21 16:55:47,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-21 16:55:47,308 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-21 16:55:47,316 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-21 16:55:47,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:47,336 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-21 16:55:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:47,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:47,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:55:47,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:55:47,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:55:47,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)))) is different from false [2022-07-21 16:55:47,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:55:47,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)))) is different from false [2022-07-21 16:55:47,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:47,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:47,399 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-21 16:55:47,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:47,405 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-21 16:55:47,406 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-21 16:55:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 77 not checked. [2022-07-21 16:55:47,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418824917] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:47,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:47,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 41 [2022-07-21 16:55:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635107312] [2022-07-21 16:55:47,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:47,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-21 16:55:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-21 16:55:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1038, Unknown=7, NotChecked=490, Total=1640 [2022-07-21 16:55:47,538 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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-21 16:55:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:48,212 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-21 16:55:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 16:55:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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-21 16:55:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:48,213 INFO L225 Difference]: With dead ends: 100 [2022-07-21 16:55:48,213 INFO L226 Difference]: Without dead ends: 71 [2022-07-21 16:55:48,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=2313, Unknown=7, NotChecked=728, Total=3306 [2022-07-21 16:55:48,215 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 73 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:48,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 431 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 833 Invalid, 0 Unknown, 502 Unchecked, 0.3s Time] [2022-07-21 16:55:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-21 16:55:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-07-21 16:55:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) 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-21 16:55:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-21 16:55:48,216 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2022-07-21 16:55:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:48,217 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-21 16:55:48,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 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-21 16:55:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-21 16:55:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 16:55:48,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:48,218 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:48,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:48,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:48,418 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 940963662, now seen corresponding path program 10 times [2022-07-21 16:55:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:48,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902774306] [2022-07-21 16:55:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 45 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902774306] [2022-07-21 16:55:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902774306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831017866] [2022-07-21 16:55:48,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:55:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:48,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:48,700 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-21 16:55:48,700 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-21 16:55:48,805 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:55:48,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:48,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-21 16:55:48,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:48,819 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:48,819 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-21 16:55:48,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:55:49,137 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 16 treesize of output 12 [2022-07-21 16:55:49,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:49,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:49,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:49,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:49,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:49,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:55:49,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:49,606 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-21 16:55:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 72 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:49,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:50,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_138| Int) (v_ArrVal_962 (Array Int Int))) (or (<= (+ 8 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|) (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_962) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|)))) is different from false [2022-07-21 16:55:50,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:50,308 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-21 16:55:50,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:50,314 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-21 16:55:50,317 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-21 16:55:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:51,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831017866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:51,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:51,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 60 [2022-07-21 16:55:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863250193] [2022-07-21 16:55:51,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:51,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-21 16:55:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:51,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-21 16:55:51,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3132, Unknown=2, NotChecked=116, Total=3660 [2022-07-21 16:55:51,374 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 states have internal predecessors, (187), 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-21 16:55:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:52,454 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-21 16:55:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 16:55:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 states have internal predecessors, (187), 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 65 [2022-07-21 16:55:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:52,455 INFO L225 Difference]: With dead ends: 80 [2022-07-21 16:55:52,455 INFO L226 Difference]: Without dead ends: 80 [2022-07-21 16:55:52,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=912, Invalid=5242, Unknown=12, NotChecked=154, Total=6320 [2022-07-21 16:55:52,457 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 132 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:52,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 371 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 789 Invalid, 0 Unknown, 293 Unchecked, 0.3s Time] [2022-07-21 16:55:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-21 16:55:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-07-21 16:55:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 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-21 16:55:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-07-21 16:55:52,458 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 65 [2022-07-21 16:55:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:52,458 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-21 16:55:52,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 states have internal predecessors, (187), 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-21 16:55:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-07-21 16:55:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 16:55:52,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:52,459 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:52,476 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-21 16:55:52,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:52,667 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash -894897563, now seen corresponding path program 8 times [2022-07-21 16:55:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:52,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769279822] [2022-07-21 16:55:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769279822] [2022-07-21 16:55:52,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769279822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:52,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988023711] [2022-07-21 16:55:52,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:52,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:52,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:52,930 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-21 16:55:52,956 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-21 16:55:53,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:53,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:53,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 16:55:53,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:53,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:55:53,070 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-21 16:55:53,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:55:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:53,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:54,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988023711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:54,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:54,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 50 [2022-07-21 16:55:54,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133911010] [2022-07-21 16:55:54,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:54,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 16:55:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:54,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 16:55:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2238, Unknown=0, NotChecked=0, Total=2550 [2022-07-21 16:55:54,037 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 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-21 16:55:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:54,531 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-21 16:55:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 16:55:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 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 66 [2022-07-21 16:55:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:54,532 INFO L225 Difference]: With dead ends: 75 [2022-07-21 16:55:54,532 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 16:55:54,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=795, Invalid=3627, Unknown=0, NotChecked=0, Total=4422 [2022-07-21 16:55:54,537 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 283 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:54,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 341 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 16:55:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-21 16:55:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 74 states have internal predecessors, (76), 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-21 16:55:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-21 16:55:54,539 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-21 16:55:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:54,540 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-21 16:55:54,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 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-21 16:55:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-21 16:55:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 16:55:54,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:54,557 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:54,574 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-21 16:55:54,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:54,759 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1905496918, now seen corresponding path program 9 times [2022-07-21 16:55:54,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:54,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384579060] [2022-07-21 16:55:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 99 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:55,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384579060] [2022-07-21 16:55:55,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384579060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:55,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109204675] [2022-07-21 16:55:55,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:55:55,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:55,006 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-21 16:55:55,042 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-21 16:55:55,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-21 16:55:55,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:55,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-21 16:55:55,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:55,370 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:55,370 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-21 16:55:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:55,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:56,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109204675] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:56,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:56,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 48 [2022-07-21 16:55:56,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728848425] [2022-07-21 16:55:56,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:56,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-21 16:55:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:56,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-21 16:55:56,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2022-07-21 16:55:56,209 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 states have internal predecessors, (171), 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-21 16:55:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:56,758 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-07-21 16:55:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 16:55:56,758 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 states have internal predecessors, (171), 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 70 [2022-07-21 16:55:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:56,759 INFO L225 Difference]: With dead ends: 117 [2022-07-21 16:55:56,759 INFO L226 Difference]: Without dead ends: 82 [2022-07-21 16:55:56,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=817, Invalid=3343, Unknown=0, NotChecked=0, Total=4160 [2022-07-21 16:55:56,759 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:56,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 198 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:55:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-21 16:55:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-21 16:55:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 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-21 16:55:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-21 16:55:56,761 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2022-07-21 16:55:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:56,761 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-21 16:55:56,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 states have internal predecessors, (171), 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-21 16:55:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-21 16:55:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 16:55:56,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:56,762 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:56,781 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-21 16:55:56,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-21 16:55:56,981 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1730266887, now seen corresponding path program 10 times [2022-07-21 16:55:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:56,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50431956] [2022-07-21 16:55:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:57,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:57,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50431956] [2022-07-21 16:55:57,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50431956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:57,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671808944] [2022-07-21 16:55:57,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:55:57,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:57,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:57,254 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-21 16:55:57,283 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-21 16:55:57,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:55:57,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:57,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 16:55:57,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:57,419 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:55:57,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:55:57,426 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-21 16:55:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 16:55:57,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 16:55:58,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671808944] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:58,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:58,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 45 [2022-07-21 16:55:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846828074] [2022-07-21 16:55:58,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:58,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-21 16:55:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-21 16:55:58,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1800, Unknown=0, NotChecked=0, Total=2070 [2022-07-21 16:55:58,473 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 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-21 16:56:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:00,554 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-21 16:56:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 16:56:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 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 74 [2022-07-21 16:56:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:00,555 INFO L225 Difference]: With dead ends: 120 [2022-07-21 16:56:00,555 INFO L226 Difference]: Without dead ends: 120 [2022-07-21 16:56:00,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1235, Invalid=5245, Unknown=0, NotChecked=0, Total=6480 [2022-07-21 16:56:00,556 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 295 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:00,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 355 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 988 Invalid, 0 Unknown, 2 Unchecked, 0.4s Time] [2022-07-21 16:56:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-21 16:56:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-07-21 16:56:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.1) internal successors, (121), 111 states have internal predecessors, (121), 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-21 16:56:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2022-07-21 16:56:00,557 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 74 [2022-07-21 16:56:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:00,558 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2022-07-21 16:56:00,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 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-21 16:56:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2022-07-21 16:56:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 16:56:00,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:00,558 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:00,585 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-21 16:56:00,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-21 16:56:00,759 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:00,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1816661881, now seen corresponding path program 11 times [2022-07-21 16:56:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:00,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438858794] [2022-07-21 16:56:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:01,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:01,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438858794] [2022-07-21 16:56:01,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438858794] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:01,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232459589] [2022-07-21 16:56:01,212 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:56:01,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:01,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:01,213 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-21 16:56:01,214 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-21 16:56:01,551 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-21 16:56:01,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:01,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-21 16:56:01,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:01,561 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-21 16:56:01,859 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-21 16:56:01,938 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-21 16:56:01,973 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-21 16:56:01,984 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-21 16:56:01,995 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-21 16:56:02,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:02,017 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-21 16:56:02,028 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-21 16:56:02,039 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-21 16:56:02,066 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-21 16:56:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:02,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:02,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:02,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:02,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:02,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:02,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:02,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:02,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)))) is different from false [2022-07-21 16:56:02,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-21 16:56:02,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:56:02,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:02,133 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-21 16:56:02,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:02,137 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-21 16:56:02,139 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-21 16:56:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 135 not checked. [2022-07-21 16:56:02,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232459589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:02,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:02,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 49 [2022-07-21 16:56:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115137868] [2022-07-21 16:56:02,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:02,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-21 16:56:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:02,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-21 16:56:02,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1464, Unknown=9, NotChecked=756, Total=2352 [2022-07-21 16:56:02,392 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 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-21 16:56:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:03,242 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-07-21 16:56:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-21 16:56:03,242 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 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-21 16:56:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:03,244 INFO L225 Difference]: With dead ends: 156 [2022-07-21 16:56:03,244 INFO L226 Difference]: Without dead ends: 119 [2022-07-21 16:56:03,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 130 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=2386, Unknown=9, NotChecked=954, Total=3540 [2022-07-21 16:56:03,245 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:03,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 651 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1384 Invalid, 0 Unknown, 598 Unchecked, 0.5s Time] [2022-07-21 16:56:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-21 16:56:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-07-21 16:56:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 115 states have internal predecessors, (125), 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-21 16:56:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-07-21 16:56:03,249 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 77 [2022-07-21 16:56:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:03,249 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-07-21 16:56:03,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 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-21 16:56:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-07-21 16:56:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-21 16:56:03,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:03,250 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:03,269 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-21 16:56:03,458 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,SelfDestructingSolverStorable36 [2022-07-21 16:56:03,458 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:03,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1542890378, now seen corresponding path program 12 times [2022-07-21 16:56:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:03,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778937822] [2022-07-21 16:56:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 91 proven. 215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:03,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778937822] [2022-07-21 16:56:03,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778937822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:03,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104432375] [2022-07-21 16:56:03,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:56:03,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:03,742 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-21 16:56:03,743 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-21 16:56:04,655 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-21 16:56:04,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:04,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-21 16:56:04,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:04,671 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:56:04,671 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-21 16:56:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:05,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:05,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104432375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:05,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:05,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 63 [2022-07-21 16:56:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493124713] [2022-07-21 16:56:05,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:05,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-21 16:56:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-21 16:56:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=3489, Unknown=0, NotChecked=0, Total=4032 [2022-07-21 16:56:05,720 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 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-21 16:56:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:06,592 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-21 16:56:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:56:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 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 81 [2022-07-21 16:56:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:06,595 INFO L225 Difference]: With dead ends: 116 [2022-07-21 16:56:06,595 INFO L226 Difference]: Without dead ends: 116 [2022-07-21 16:56:06,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1338, Invalid=5634, Unknown=0, NotChecked=0, Total=6972 [2022-07-21 16:56:06,597 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 371 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:06,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 270 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:56:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-21 16:56:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-21 16:56:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.087719298245614) internal successors, (124), 115 states have internal predecessors, (124), 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-21 16:56:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2022-07-21 16:56:06,599 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 81 [2022-07-21 16:56:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:06,599 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2022-07-21 16:56:06,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 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-21 16:56:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2022-07-21 16:56:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-21 16:56:06,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:06,600 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:06,619 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-21 16:56:06,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:06,818 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:06,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1904201381, now seen corresponding path program 13 times [2022-07-21 16:56:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:06,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445374034] [2022-07-21 16:56:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:07,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445374034] [2022-07-21 16:56:07,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445374034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:07,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451155558] [2022-07-21 16:56:07,293 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:56:07,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:07,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:07,295 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-21 16:56:07,320 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-21 16:56:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:07,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-21 16:56:07,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:07,467 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-21 16:56:07,786 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-21 16:56:07,856 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-21 16:56:07,886 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-21 16:56:07,894 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-21 16:56:07,903 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-21 16:56:07,912 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-21 16:56:07,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-21 16:56:07,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:07,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:07,948 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-21 16:56:07,972 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-21 16:56:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:07,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:07,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:07,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:07,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:07,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:08,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:08,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:08,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-21 16:56:08,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-21 16:56:08,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-21 16:56:08,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:56:08,062 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:08,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:56:08,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:08,066 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-21 16:56:08,068 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-21 16:56:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 170 not checked. [2022-07-21 16:56:08,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451155558] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:08,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:08,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 53 [2022-07-21 16:56:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119958640] [2022-07-21 16:56:08,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:08,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-21 16:56:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-21 16:56:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1704, Unknown=10, NotChecked=910, Total=2756 [2022-07-21 16:56:08,414 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 states have internal predecessors, (173), 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-21 16:56:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:09,503 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2022-07-21 16:56:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 16:56:09,504 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 states have internal predecessors, (173), 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 85 [2022-07-21 16:56:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:09,504 INFO L225 Difference]: With dead ends: 164 [2022-07-21 16:56:09,505 INFO L226 Difference]: Without dead ends: 123 [2022-07-21 16:56:09,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 144 SyntacticMatches, 17 SemanticMatches, 63 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=205, Invalid=2795, Unknown=10, NotChecked=1150, Total=4160 [2022-07-21 16:56:09,505 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 867 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:09,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 795 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1867 Invalid, 0 Unknown, 867 Unchecked, 0.6s Time] [2022-07-21 16:56:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-21 16:56:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2022-07-21 16:56:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.0847457627118644) internal successors, (128), 119 states have internal predecessors, (128), 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-21 16:56:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-07-21 16:56:09,507 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 85 [2022-07-21 16:56:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:09,507 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-07-21 16:56:09,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 states have internal predecessors, (173), 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-21 16:56:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-07-21 16:56:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-21 16:56:09,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:09,508 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:09,527 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-21 16:56:09,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-21 16:56:09,715 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1305948504, now seen corresponding path program 14 times [2022-07-21 16:56:09,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:09,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476733877] [2022-07-21 16:56:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 120 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:10,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:10,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476733877] [2022-07-21 16:56:10,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476733877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:10,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161052396] [2022-07-21 16:56:10,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:56:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:10,047 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-21 16:56:10,094 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-21 16:56:10,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:56:10,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:10,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 16:56:10,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:10,230 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:56:10,230 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-21 16:56:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 153 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:10,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:11,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161052396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:11,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:11,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 68 [2022-07-21 16:56:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289805032] [2022-07-21 16:56:11,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:11,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-21 16:56:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:11,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-21 16:56:11,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4152, Unknown=0, NotChecked=0, Total=4692 [2022-07-21 16:56:11,748 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 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-21 16:56:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:12,556 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-07-21 16:56:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 16:56:12,557 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 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 89 [2022-07-21 16:56:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:12,557 INFO L225 Difference]: With dead ends: 120 [2022-07-21 16:56:12,557 INFO L226 Difference]: Without dead ends: 120 [2022-07-21 16:56:12,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1419, Invalid=6771, Unknown=0, NotChecked=0, Total=8190 [2022-07-21 16:56:12,559 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 412 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:12,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 558 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 16:56:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-21 16:56:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-21 16:56:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 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-21 16:56:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2022-07-21 16:56:12,561 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 89 [2022-07-21 16:56:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:12,561 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2022-07-21 16:56:12,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 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-21 16:56:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-07-21 16:56:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 16:56:12,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:12,570 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:12,588 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-21 16:56:12,786 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,SelfDestructingSolverStorable39 [2022-07-21 16:56:12,786 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:12,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1102366013, now seen corresponding path program 15 times [2022-07-21 16:56:12,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:12,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23112464] [2022-07-21 16:56:12,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:12,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:13,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:13,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23112464] [2022-07-21 16:56:13,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23112464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:13,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837011468] [2022-07-21 16:56:13,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:56:13,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:13,312 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-21 16:56:13,313 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-21 16:56:14,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-21 16:56:14,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:14,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-21 16:56:14,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:14,937 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-21 16:56:15,274 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-21 16:56:15,341 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-21 16:56:15,370 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-21 16:56:15,379 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-21 16:56:15,386 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-21 16:56:15,394 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-21 16:56:15,414 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-21 16:56:15,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 16 treesize of output 18 [2022-07-21 16:56:15,435 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-21 16:56:15,442 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-21 16:56:15,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-21 16:56:15,453 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-21 16:56:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:15,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:15,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:15,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:15,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:15,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:15,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:15,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:15,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-21 16:56:15,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-21 16:56:15,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-21 16:56:15,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-21 16:56:15,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1685) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:56:15,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:15,555 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-21 16:56:15,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:15,558 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-21 16:56:15,560 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-21 16:56:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 209 not checked. [2022-07-21 16:56:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837011468] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:15,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:15,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 57 [2022-07-21 16:56:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306952243] [2022-07-21 16:56:15,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-21 16:56:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-21 16:56:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1962, Unknown=11, NotChecked=1078, Total=3192 [2022-07-21 16:56:15,800 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 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-21 16:56:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:16,902 INFO L93 Difference]: Finished difference Result 172 states and 179 transitions. [2022-07-21 16:56:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-21 16:56:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 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 93 [2022-07-21 16:56:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:16,903 INFO L225 Difference]: With dead ends: 172 [2022-07-21 16:56:16,903 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 16:56:16,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=336, Invalid=4527, Unknown=11, NotChecked=1606, Total=6480 [2022-07-21 16:56:16,904 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 103 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:16,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 842 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1920 Invalid, 0 Unknown, 1059 Unchecked, 0.5s Time] [2022-07-21 16:56:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 16:56:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-21 16:56:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0737704918032787) internal successors, (131), 123 states have internal predecessors, (131), 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-21 16:56:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2022-07-21 16:56:16,908 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 93 [2022-07-21 16:56:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:16,908 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2022-07-21 16:56:16,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 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-21 16:56:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2022-07-21 16:56:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 16:56:16,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:16,909 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:16,931 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-21 16:56:17,129 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,SelfDestructingSolverStorable40 [2022-07-21 16:56:17,129 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash 46237638, now seen corresponding path program 16 times [2022-07-21 16:56:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:17,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139500986] [2022-07-21 16:56:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 153 proven. 309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:17,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139500986] [2022-07-21 16:56:17,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139500986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:17,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450035929] [2022-07-21 16:56:17,491 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:56:17,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:17,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:17,504 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-21 16:56:17,518 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-21 16:56:17,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:56:17,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:17,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-21 16:56:17,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:17,682 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-21 16:56:17,685 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-21 16:56:18,081 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 16 treesize of output 12 [2022-07-21 16:56:18,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:18,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:18,635 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-21 16:56:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 200 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:18,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:19,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_303| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 10 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|) (<= (+ 12 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|)))) is different from false [2022-07-21 16:56:19,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:19,517 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-21 16:56:19,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:19,521 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-21 16:56:19,523 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-21 16:56:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450035929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:20,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:20,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 30] total 84 [2022-07-21 16:56:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675278189] [2022-07-21 16:56:20,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:20,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-07-21 16:56:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-07-21 16:56:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=786, Invalid=6187, Unknown=3, NotChecked=164, Total=7140 [2022-07-21 16:56:20,741 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 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-21 16:56:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:22,315 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-21 16:56:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 16:56:22,315 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 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-21 16:56:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:22,316 INFO L225 Difference]: With dead ends: 124 [2022-07-21 16:56:22,316 INFO L226 Difference]: Without dead ends: 124 [2022-07-21 16:56:22,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1666, Invalid=9669, Unknown=11, NotChecked=210, Total=11556 [2022-07-21 16:56:22,317 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 293 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 604 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:22,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 612 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1259 Invalid, 0 Unknown, 604 Unchecked, 0.4s Time] [2022-07-21 16:56:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-21 16:56:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-21 16:56:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0573770491803278) internal successors, (129), 123 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-21 16:56:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-21 16:56:22,343 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 97 [2022-07-21 16:56:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:22,343 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-21 16:56:22,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 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-21 16:56:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-21 16:56:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-21 16:56:22,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:22,344 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:22,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-21 16:56:22,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:22,562 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -374809476, now seen corresponding path program 17 times [2022-07-21 16:56:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:22,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672658429] [2022-07-21 16:56:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 280 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:22,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:22,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672658429] [2022-07-21 16:56:22,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672658429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:22,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450725903] [2022-07-21 16:56:22,897 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:56:22,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:22,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:22,898 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-21 16:56:22,902 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-21 16:56:24,568 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-21 16:56:24,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:24,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-21 16:56:24,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:24,590 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:56:24,590 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-21 16:56:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 325 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:25,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 325 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:25,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450725903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:25,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:25,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 68 [2022-07-21 16:56:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973153924] [2022-07-21 16:56:25,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:25,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-21 16:56:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-21 16:56:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=3769, Unknown=0, NotChecked=0, Total=4556 [2022-07-21 16:56:25,812 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 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-21 16:56:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:26,615 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2022-07-21 16:56:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 16:56:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 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 105 [2022-07-21 16:56:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:26,616 INFO L225 Difference]: With dead ends: 182 [2022-07-21 16:56:26,616 INFO L226 Difference]: Without dead ends: 131 [2022-07-21 16:56:26,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1615, Invalid=6941, Unknown=0, NotChecked=0, Total=8556 [2022-07-21 16:56:26,618 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:26,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 226 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:56:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-21 16:56:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2022-07-21 16:56:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.0555555555555556) internal successors, (133), 127 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-21 16:56:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-07-21 16:56:26,620 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 105 [2022-07-21 16:56:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:26,622 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-07-21 16:56:26,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 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-21 16:56:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-07-21 16:56:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 16:56:26,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:26,623 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:26,668 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-21 16:56:26,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:26,824 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1637661951, now seen corresponding path program 18 times [2022-07-21 16:56:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:26,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984737054] [2022-07-21 16:56:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984737054] [2022-07-21 16:56:27,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984737054] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60422610] [2022-07-21 16:56:27,344 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:56:27,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:27,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:27,346 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-21 16:56:27,347 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-21 16:56:29,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-21 16:56:29,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:29,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-21 16:56:29,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:29,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:56:29,978 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-21 16:56:30,077 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-21 16:56:30,114 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-21 16:56:30,125 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-21 16:56:30,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-21 16:56:30,148 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-21 16:56:30,159 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-21 16:56:30,170 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-21 16:56:30,182 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-21 16:56:30,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:30,205 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-21 16:56:30,217 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-21 16:56:30,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:56:30,239 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-21 16:56:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:30,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:30,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:30,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:30,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:30,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:30,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)))) is different from false [2022-07-21 16:56:30,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:30,347 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-21 16:56:30,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-21 16:56:30,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-21 16:56:30,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-21 16:56:30,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-21 16:56:30,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-21 16:56:30,398 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2043) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:56:30,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:30,402 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-21 16:56:30,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:30,408 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-21 16:56:30,411 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-21 16:56:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 299 not checked. [2022-07-21 16:56:30,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60422610] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:30,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:30,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 65 [2022-07-21 16:56:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162527921] [2022-07-21 16:56:30,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:30,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-21 16:56:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-21 16:56:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2532, Unknown=13, NotChecked=1456, Total=4160 [2022-07-21 16:56:30,754 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 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-21 16:56:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:31,990 INFO L93 Difference]: Finished difference Result 188 states and 193 transitions. [2022-07-21 16:56:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 16:56:31,990 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 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 109 [2022-07-21 16:56:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:31,991 INFO L225 Difference]: With dead ends: 188 [2022-07-21 16:56:31,991 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 16:56:31,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 21 SemanticMatches, 79 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=261, Invalid=4334, Unknown=13, NotChecked=1872, Total=6480 [2022-07-21 16:56:31,992 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 4090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1440 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:31,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1101 Invalid, 4090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2632 Invalid, 0 Unknown, 1440 Unchecked, 0.6s Time] [2022-07-21 16:56:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 16:56:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-21 16:56:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 1.0538461538461539) internal successors, (137), 131 states have internal predecessors, (137), 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-21 16:56:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2022-07-21 16:56:31,995 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 109 [2022-07-21 16:56:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:31,995 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2022-07-21 16:56:31,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 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-21 16:56:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2022-07-21 16:56:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-21 16:56:32,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:32,000 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:32,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-21 16:56:32,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:32,219 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash 64398338, now seen corresponding path program 19 times [2022-07-21 16:56:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446679312] [2022-07-21 16:56:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 231 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:32,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:32,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446679312] [2022-07-21 16:56:32,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446679312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:32,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301019860] [2022-07-21 16:56:32,686 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:56:32,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:32,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:32,687 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-21 16:56:32,688 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-21 16:56:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:32,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-21 16:56:32,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 276 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:33,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:33,842 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-21 16:56:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 276 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:33,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301019860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:33,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:33,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 63 [2022-07-21 16:56:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506304520] [2022-07-21 16:56:33,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:33,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-21 16:56:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-21 16:56:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=3538, Unknown=0, NotChecked=0, Total=4032 [2022-07-21 16:56:33,926 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 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-21 16:56:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:34,936 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-07-21 16:56:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 16:56:34,937 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 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 113 [2022-07-21 16:56:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:34,937 INFO L225 Difference]: With dead ends: 132 [2022-07-21 16:56:34,937 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 16:56:34,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1158, Invalid=5162, Unknown=0, NotChecked=0, Total=6320 [2022-07-21 16:56:34,938 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 408 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:34,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 738 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 16:56:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 16:56:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-21 16:56:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 131 states have internal predecessors, (136), 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-21 16:56:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-07-21 16:56:34,940 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 113 [2022-07-21 16:56:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:34,940 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-07-21 16:56:34,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 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-21 16:56:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-07-21 16:56:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 16:56:34,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:34,941 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:34,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:35,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-21 16:56:35,151 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:35,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 804967197, now seen corresponding path program 20 times [2022-07-21 16:56:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:35,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754865684] [2022-07-21 16:56:35,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:35,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 27 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:35,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754865684] [2022-07-21 16:56:35,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754865684] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:35,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666684093] [2022-07-21 16:56:35,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:56:35,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:35,881 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:35,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-21 16:56:36,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:56:36,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:36,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-21 16:56:36,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:36,084 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-21 16:56:36,088 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-21 16:56:36,845 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-21 16:56:37,045 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-21 16:56:37,132 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-21 16:56:37,216 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-21 16:56:37,295 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-21 16:56:37,373 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-21 16:56:37,451 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-21 16:56:37,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 17 treesize of output 19 [2022-07-21 16:56:37,624 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-21 16:56:37,729 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-21 16:56:37,815 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-21 16:56:37,906 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-21 16:56:38,002 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-21 16:56:38,089 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-21 16:56:38,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:38,216 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 18 treesize of output 18 [2022-07-21 16:56:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 276 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:38,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:39,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2302 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_411| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|)) (<= (+ 15 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2302) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|)) 0))) is different from false [2022-07-21 16:56:39,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:39,897 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-21 16:56:39,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:39,902 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-21 16:56:39,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:56:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 325 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:41,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666684093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:41,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:41,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 102 [2022-07-21 16:56:41,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313915137] [2022-07-21 16:56:41,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:41,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-07-21 16:56:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-07-21 16:56:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=9417, Unknown=2, NotChecked=198, Total=10302 [2022-07-21 16:56:41,829 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 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-21 16:56:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:44,052 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2022-07-21 16:56:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-21 16:56:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 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-21 16:56:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:44,053 INFO L225 Difference]: With dead ends: 196 [2022-07-21 16:56:44,053 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 16:56:44,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1331, Invalid=16761, Unknown=2, NotChecked=266, Total=18360 [2022-07-21 16:56:44,054 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 152 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1072 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:44,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1580 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1663 Invalid, 0 Unknown, 1072 Unchecked, 0.5s Time] [2022-07-21 16:56:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 16:56:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-07-21 16:56:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.037313432835821) internal successors, (139), 135 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-21 16:56:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions. [2022-07-21 16:56:44,056 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 117 [2022-07-21 16:56:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:44,056 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions. [2022-07-21 16:56:44,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 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-21 16:56:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2022-07-21 16:56:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-21 16:56:44,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:44,057 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:44,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:44,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:44,257 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1561098043, now seen corresponding path program 21 times [2022-07-21 16:56:44,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:44,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979476244] [2022-07-21 16:56:44,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:44,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:45,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:45,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979476244] [2022-07-21 16:56:45,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979476244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:45,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289336777] [2022-07-21 16:56:45,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:56:45,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:45,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:45,033 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:45,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-21 16:56:47,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-21 16:56:47,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:48,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-21 16:56:48,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:48,040 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-21 16:56:48,691 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-21 16:56:48,801 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-21 16:56:48,841 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-21 16:56:48,852 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-21 16:56:48,864 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-21 16:56:48,875 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-21 16:56:48,905 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-21 16:56:48,914 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-21 16:56:48,925 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-21 16:56:48,936 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-21 16:56:48,946 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-21 16:56:48,957 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-21 16:56:48,969 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-21 16:56:48,978 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-21 16:56:48,989 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-21 16:56:49,027 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-21 16:56:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:49,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:49,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:56:49,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:56:49,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:56:49,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:56:49,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:56:49,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-21 16:56:49,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-21 16:56:49,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-21 16:56:49,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-21 16:56:49,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-21 16:56:49,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-21 16:56:49,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-21 16:56:49,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-21 16:56:49,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-21 16:56:49,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2450) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:56:49,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:49,136 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-21 16:56:49,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:49,140 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-21 16:56:49,143 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-21 16:56:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 405 not checked. [2022-07-21 16:56:49,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289336777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:49,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:49,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 37] total 73 [2022-07-21 16:56:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790304886] [2022-07-21 16:56:49,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:49,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-21 16:56:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-21 16:56:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3174, Unknown=15, NotChecked=1890, Total=5256 [2022-07-21 16:56:49,578 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 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-21 16:56:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:56:51,279 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2022-07-21 16:56:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-21 16:56:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 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 125 [2022-07-21 16:56:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:56:51,283 INFO L225 Difference]: With dead ends: 204 [2022-07-21 16:56:51,284 INFO L226 Difference]: Without dead ends: 143 [2022-07-21 16:56:51,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 219 SyntacticMatches, 22 SemanticMatches, 88 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=275, Invalid=5320, Unknown=15, NotChecked=2400, Total=8010 [2022-07-21 16:56:51,287 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 3816 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 5803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1967 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:56:51,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1514 Invalid, 5803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3816 Invalid, 0 Unknown, 1967 Unchecked, 1.0s Time] [2022-07-21 16:56:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-21 16:56:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2022-07-21 16:56:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.036231884057971) internal successors, (143), 139 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-21 16:56:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2022-07-21 16:56:51,291 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 125 [2022-07-21 16:56:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:56:51,291 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2022-07-21 16:56:51,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 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-21 16:56:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2022-07-21 16:56:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-21 16:56:51,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:56:51,292 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:56:51,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-21 16:56:51,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:51,504 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:56:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:56:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1500121026, now seen corresponding path program 22 times [2022-07-21 16:56:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:56:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830605272] [2022-07-21 16:56:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:56:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:56:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:56:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 325 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:52,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:56:52,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830605272] [2022-07-21 16:56:52,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830605272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:56:52,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763047526] [2022-07-21 16:56:52,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:56:52,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:56:52,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:56:52,176 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:56:52,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-21 16:56:52,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:56:52,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:56:52,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-21 16:56:52,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:56:52,487 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-21 16:56:52,490 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-21 16:56:53,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 16 treesize of output 12 [2022-07-21 16:56:53,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:53,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:54,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:54,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:54,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:54,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:54,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:56:54,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:54,529 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-21 16:56:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 392 proven. 478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:54,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:56:55,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2605 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_472| Int)) (or (<= (+ 16 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2605) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|)) 0))) is different from false [2022-07-21 16:56:55,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:55,997 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-21 16:56:56,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:56:56,005 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-21 16:56:56,008 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-21 16:56:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:56:58,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763047526] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:56:58,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:56:58,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 38] total 107 [2022-07-21 16:56:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084073242] [2022-07-21 16:56:58,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:56:58,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-21 16:56:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:56:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-21 16:56:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1166, Invalid=10177, Unknown=3, NotChecked=210, Total=11556 [2022-07-21 16:56:58,177 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 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-21 16:57:00,223 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (and (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14) (<= 15 .cse0) (<= 14 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (or (not (= |c_ULTIMATE.start_cstrcpy_~from#1.offset| (+ .cse0 (- 1)))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (<= .cse1 .cse0) (or (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3) .cse0) (<= 0 .cse1)) (forall ((v_ArrVal_2605 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2605) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0))))) is different from false [2022-07-21 16:57:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:00,553 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-21 16:57:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-21 16:57:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 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 129 [2022-07-21 16:57:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:00,554 INFO L225 Difference]: With dead ends: 142 [2022-07-21 16:57:00,554 INFO L226 Difference]: Without dead ends: 142 [2022-07-21 16:57:00,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2506, Invalid=15031, Unknown=27, NotChecked=526, Total=18090 [2022-07-21 16:57:00,555 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 343 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:00,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1041 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1540 Invalid, 0 Unknown, 395 Unchecked, 0.7s Time] [2022-07-21 16:57:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-21 16:57:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2022-07-21 16:57:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.0217391304347827) internal successors, (141), 139 states have internal predecessors, (141), 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-21 16:57:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2022-07-21 16:57:00,557 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 129 [2022-07-21 16:57:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:00,557 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2022-07-21 16:57:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 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-21 16:57:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-07-21 16:57:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-21 16:57:00,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:00,558 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:00,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-21 16:57:00,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-21 16:57:00,764 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:57:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash -366914316, now seen corresponding path program 23 times [2022-07-21 16:57:00,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:00,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765592585] [2022-07-21 16:57:00,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:00,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 500 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:01,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765592585] [2022-07-21 16:57:01,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765592585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:01,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363349014] [2022-07-21 16:57:01,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:57:01,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:01,262 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:01,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-21 16:57:04,007 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-21 16:57:04,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:57:04,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-21 16:57:04,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:04,033 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:57:04,034 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-21 16:57:04,851 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-21 16:57:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 561 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:05,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:05,243 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 6 treesize of output 4 [2022-07-21 16:57:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 561 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:05,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363349014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:05,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:05,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 88 [2022-07-21 16:57:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008424043] [2022-07-21 16:57:05,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:05,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-07-21 16:57:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:05,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-07-21 16:57:05,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=6357, Unknown=0, NotChecked=0, Total=7656 [2022-07-21 16:57:05,997 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 states have internal predecessors, (334), 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-21 16:57:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:07,307 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-21 16:57:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-21 16:57:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 states have internal predecessors, (334), 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-21 16:57:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:07,308 INFO L225 Difference]: With dead ends: 214 [2022-07-21 16:57:07,308 INFO L226 Difference]: Without dead ends: 147 [2022-07-21 16:57:07,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2685, Invalid=11835, Unknown=0, NotChecked=0, Total=14520 [2022-07-21 16:57:07,309 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 138 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:07,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 325 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:57:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-21 16:57:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-07-21 16:57:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.0211267605633803) internal successors, (145), 143 states have internal predecessors, (145), 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-21 16:57:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-07-21 16:57:07,311 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 137 [2022-07-21 16:57:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:07,311 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-07-21 16:57:07,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 states have internal predecessors, (334), 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-21 16:57:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-07-21 16:57:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 16:57:07,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:07,312 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:07,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-07-21 16:57:07,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-21 16:57:07,519 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:57:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -366217, now seen corresponding path program 24 times [2022-07-21 16:57:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:07,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661185063] [2022-07-21 16:57:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:08,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661185063] [2022-07-21 16:57:08,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661185063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:08,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866999859] [2022-07-21 16:57:08,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:57:08,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:08,475 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:08,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-21 16:57:22,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-21 16:57:22,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:57:22,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 176 conjunts are in the unsatisfiable core [2022-07-21 16:57:22,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:22,124 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-21 16:57:22,888 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-21 16:57:23,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-21 16:57:23,055 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-21 16:57:23,066 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-21 16:57:23,077 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-21 16:57:23,089 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-21 16:57:23,101 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-21 16:57:23,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-21 16:57:23,124 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-21 16:57:23,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:57:23,166 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-21 16:57:23,176 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-21 16:57:23,206 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-21 16:57:23,231 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-21 16:57:23,247 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-21 16:57:23,259 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-21 16:57:23,271 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-21 16:57:23,298 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-21 16:57:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:23,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:23,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:57:23,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:57:23,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:57:23,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:57:23,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:57:23,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-21 16:57:23,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)))) is different from false [2022-07-21 16:57:23,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-21 16:57:23,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-21 16:57:23,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-21 16:57:23,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-21 16:57:23,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-21 16:57:23,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-21 16:57:23,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-21 16:57:23,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15)) 0)) is different from false [2022-07-21 16:57:23,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 16)) 0)) is different from false [2022-07-21 16:57:23,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2915) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:57:23,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:23,469 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-21 16:57:23,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:23,474 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-21 16:57:23,476 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-21 16:57:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 527 not checked. [2022-07-21 16:57:23,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866999859] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:23,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:23,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 41] total 81 [2022-07-21 16:57:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841566374] [2022-07-21 16:57:24,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:24,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-21 16:57:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-21 16:57:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3888, Unknown=17, NotChecked=2380, Total=6480 [2022-07-21 16:57:24,001 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 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-21 16:57:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:26,343 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2022-07-21 16:57:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-21 16:57:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 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 141 [2022-07-21 16:57:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:26,344 INFO L225 Difference]: With dead ends: 220 [2022-07-21 16:57:26,344 INFO L226 Difference]: Without dead ends: 151 [2022-07-21 16:57:26,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 247 SyntacticMatches, 26 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=303, Invalid=6554, Unknown=17, NotChecked=3026, Total=9900 [2022-07-21 16:57:26,345 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 4745 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 7217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2452 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:26,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1847 Invalid, 7217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4745 Invalid, 0 Unknown, 2452 Unchecked, 1.4s Time] [2022-07-21 16:57:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-21 16:57:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-07-21 16:57:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.0205479452054795) 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-21 16:57:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-21 16:57:26,359 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 141 [2022-07-21 16:57:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:26,360 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-21 16:57:26,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 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-21 16:57:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-21 16:57:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 16:57:26,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:26,361 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:26,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-21 16:57:26,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-21 16:57:26,585 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:57:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1570798470, now seen corresponding path program 25 times [2022-07-21 16:57:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:26,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575917567] [2022-07-21 16:57:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 435 proven. 687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:27,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575917567] [2022-07-21 16:57:27,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575917567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:27,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908672338] [2022-07-21 16:57:27,274 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:57:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:27,275 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:27,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-21 16:57:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:27,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-21 16:57:27,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 496 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:28,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:29,189 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-21 16:57:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 496 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:29,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908672338] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:29,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:29,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 39] total 78 [2022-07-21 16:57:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869609414] [2022-07-21 16:57:29,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:29,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-21 16:57:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:29,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-21 16:57:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=5550, Unknown=0, NotChecked=0, Total=6162 [2022-07-21 16:57:29,250 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 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-21 16:57:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:30,885 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-07-21 16:57:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 16:57:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 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 145 [2022-07-21 16:57:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:30,901 INFO L225 Difference]: With dead ends: 155 [2022-07-21 16:57:30,901 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 16:57:30,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2382, Invalid=10728, Unknown=0, NotChecked=0, Total=13110 [2022-07-21 16:57:30,902 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 701 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:30,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1063 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 16:57:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 16:57:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-21 16:57:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 150 states have internal predecessors, (152), 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-21 16:57:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-07-21 16:57:30,904 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 145 [2022-07-21 16:57:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:30,904 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-07-21 16:57:30,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 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-21 16:57:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-07-21 16:57:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 16:57:30,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:30,906 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:30,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-21 16:57:31,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:31,124 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:57:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:31,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1450112327, now seen corresponding path program 11 times [2022-07-21 16:57:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:31,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43842070] [2022-07-21 16:57:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 435 proven. 704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:31,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43842070] [2022-07-21 16:57:31,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43842070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:31,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429973980] [2022-07-21 16:57:31,735 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:57:31,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:31,737 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:31,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-21 16:57:46,162 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-21 16:57:46,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:57:46,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-21 16:57:46,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:46,201 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-21 16:57:46,204 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-21 16:57:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:47,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 561 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:49,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429973980] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:49,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:49,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2022-07-21 16:57:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991349556] [2022-07-21 16:57:49,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:49,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-07-21 16:57:49,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:49,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-07-21 16:57:49,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=10525, Unknown=0, NotChecked=0, Total=11990 [2022-07-21 16:57:49,555 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 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-21 16:57:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:50,755 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2022-07-21 16:57:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 16:57:50,756 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 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 146 [2022-07-21 16:57:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:50,756 INFO L225 Difference]: With dead ends: 154 [2022-07-21 16:57:50,756 INFO L226 Difference]: Without dead ends: 154 [2022-07-21 16:57:50,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2815, Invalid=14215, Unknown=0, NotChecked=0, Total=17030 [2022-07-21 16:57:50,762 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 661 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:50,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1097 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 3156 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 16:57:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-21 16:57:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-07-21 16:57:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 150 states have (on average 1.02) 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-21 16:57:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-21 16:57:50,764 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 146 [2022-07-21 16:57:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:50,764 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-21 16:57:50,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 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-21 16:57:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-21 16:57:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-21 16:57:50,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:50,765 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:50,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-07-21 16:57:50,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:50,985 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:57:50,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1515276395, now seen corresponding path program 26 times [2022-07-21 16:57:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:50,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357094339] [2022-07-21 16:57:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 35 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:51,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357094339] [2022-07-21 16:57:51,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357094339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:51,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67465876] [2022-07-21 16:57:51,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:57:51,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:51,826 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:57:51,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-07-21 16:57:52,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:57:52,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:57:52,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-21 16:57:52,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:52,154 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:57:52,155 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-21 16:57:52,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-21 16:57:53,005 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-21 16:57:53,186 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-21 16:57:53,293 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-21 16:57:53,383 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-21 16:57:53,471 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-21 16:57:53,574 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-21 16:57:53,682 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-21 16:57:53,776 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-21 16:57:53,929 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-21 16:57:54,045 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-21 16:57:54,185 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-21 16:57:54,280 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-21 16:57:54,383 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-21 16:57:54,483 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-21 16:57:54,586 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-21 16:57:54,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 17 treesize of output 19 [2022-07-21 16:57:54,812 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-21 16:57:54,915 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-21 16:57:55,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:55,096 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 18 treesize of output 18 [2022-07-21 16:57:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 496 proven. 695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:55,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:57,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3395 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_630| Int)) (or (<= (+ 19 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|) (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_3395) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 17 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|)))) is different from false [2022-07-21 16:57:57,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:57,070 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-21 16:57:57,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:57:57,075 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-21 16:57:57,077 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-21 16:57:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 561 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:59,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67465876] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:59,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:59,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43, 43] total 126 [2022-07-21 16:57:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619479130] [2022-07-21 16:57:59,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:59,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-21 16:57:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:59,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-21 16:57:59,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=14493, Unknown=1, NotChecked=246, Total=15750 [2022-07-21 16:57:59,759 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 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-21 16:58:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:03,363 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2022-07-21 16:58:03,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-21 16:58:03,363 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 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 149 [2022-07-21 16:58:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:03,364 INFO L225 Difference]: With dead ends: 239 [2022-07-21 16:58:03,364 INFO L226 Difference]: Without dead ends: 166 [2022-07-21 16:58:03,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 280 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3667 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1938, Invalid=25787, Unknown=1, NotChecked=330, Total=28056 [2022-07-21 16:58:03,366 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 198 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 2372 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1357 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:03,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 2207 Invalid, 3772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2372 Invalid, 0 Unknown, 1357 Unchecked, 0.8s Time] [2022-07-21 16:58:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-21 16:58:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 159. [2022-07-21 16:58:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.019108280254777) internal successors, (160), 158 states have internal predecessors, (160), 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-21 16:58:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-07-21 16:58:03,384 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2022-07-21 16:58:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:03,385 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-07-21 16:58:03,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 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-21 16:58:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-07-21 16:58:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-21 16:58:03,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:03,386 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:03,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-07-21 16:58:03,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-07-21 16:58:03,597 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:58:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash -349318309, now seen corresponding path program 12 times [2022-07-21 16:58:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:03,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288720228] [2022-07-21 16:58:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 496 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288720228] [2022-07-21 16:58:04,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288720228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127825819] [2022-07-21 16:58:04,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:58:04,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:04,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:04,327 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:58:04,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-07-21 16:58:42,316 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-07-21 16:58:42,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:42,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-21 16:58:42,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:42,385 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:58:42,385 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-21 16:58:42,395 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-21 16:58:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 561 proven. 717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:43,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 630 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:45,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127825819] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:45,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:45,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40, 40] total 117 [2022-07-21 16:58:45,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075555810] [2022-07-21 16:58:45,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:45,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-07-21 16:58:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:45,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-07-21 16:58:45,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1778, Invalid=12028, Unknown=0, NotChecked=0, Total=13806 [2022-07-21 16:58:45,682 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 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-21 16:58:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:47,714 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-07-21 16:58:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-21 16:58:47,714 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 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 154 [2022-07-21 16:58:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:47,715 INFO L225 Difference]: With dead ends: 162 [2022-07-21 16:58:47,715 INFO L226 Difference]: Without dead ends: 162 [2022-07-21 16:58:47,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5387 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4495, Invalid=19997, Unknown=0, NotChecked=0, Total=24492 [2022-07-21 16:58:47,716 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 916 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:47,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 591 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 16:58:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-21 16:58:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2022-07-21 16:58:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 1.018987341772152) internal successors, (161), 159 states have internal predecessors, (161), 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-21 16:58:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2022-07-21 16:58:47,718 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 154 [2022-07-21 16:58:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:47,719 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2022-07-21 16:58:47,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 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-21 16:58:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-07-21 16:58:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 16:58:47,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:47,720 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:47,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-07-21 16:58:47,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-07-21 16:58:47,927 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:58:47,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 164008883, now seen corresponding path program 27 times [2022-07-21 16:58:47,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:47,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648136576] [2022-07-21 16:58:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:47,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648136576] [2022-07-21 16:58:48,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648136576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226488186] [2022-07-21 16:58:48,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:58:48,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:48,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:48,804 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:58:48,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-07-21 16:58:59,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-07-21 16:58:59,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:59,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-21 16:58:59,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:59,484 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-21 16:59:00,105 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-21 16:59:00,225 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-21 16:59:00,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-21 16:59:00,271 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-21 16:59:00,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-21 16:59:00,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-21 16:59:00,291 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-21 16:59:00,298 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-21 16:59:00,306 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-21 16:59:00,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-21 16:59:00,319 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-21 16:59:00,327 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-21 16:59:00,336 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-21 16:59:00,343 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-21 16:59:00,351 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-21 16:59:00,358 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-21 16:59:00,365 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-21 16:59:00,374 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-21 16:59:00,381 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-21 16:59:00,414 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-21 16:59:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:00,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:00,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-21 16:59:00,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-21 16:59:00,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-21 16:59:00,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-21 16:59:00,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-21 16:59:00,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-21 16:59:00,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-21 16:59:00,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-21 16:59:00,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-21 16:59:00,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-21 16:59:00,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-21 16:59:00,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-21 16:59:00,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-21 16:59:00,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-21 16:59:00,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15)) 0)) is different from false [2022-07-21 16:59:00,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 16)) 0)) is different from false [2022-07-21 16:59:00,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 17)) 0)) is different from false [2022-07-21 16:59:00,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 18)))) is different from false [2022-07-21 16:59:00,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3740) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:00,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:00,541 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-21 16:59:00,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:00,544 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-21 16:59:00,545 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-21 16:59:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 631 refuted. 0 times theorem prover too weak. 0 trivial. 665 not checked. [2022-07-21 16:59:01,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226488186] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:01,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:01,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45, 45] total 89 [2022-07-21 16:59:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677141790] [2022-07-21 16:59:01,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:01,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-21 16:59:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-21 16:59:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=4674, Unknown=19, NotChecked=2926, Total=7832 [2022-07-21 16:59:01,061 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 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-21 16:59:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:04,038 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-07-21 16:59:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-21 16:59:04,038 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 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-21 16:59:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:04,039 INFO L225 Difference]: With dead ends: 244 [2022-07-21 16:59:04,039 INFO L226 Difference]: Without dead ends: 167 [2022-07-21 16:59:04,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 273 SyntacticMatches, 31 SemanticMatches, 111 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=367, Invalid=8432, Unknown=19, NotChecked=3838, Total=12656 [2022-07-21 16:59:04,045 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 81 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 6077 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 9142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3033 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:04,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2326 Invalid, 9142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 6077 Invalid, 0 Unknown, 3033 Unchecked, 1.7s Time] [2022-07-21 16:59:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-21 16:59:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2022-07-21 16:59:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.0185185185185186) internal successors, (165), 163 states have internal predecessors, (165), 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-21 16:59:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2022-07-21 16:59:04,048 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 157 [2022-07-21 16:59:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:04,048 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2022-07-21 16:59:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 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-21 16:59:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2022-07-21 16:59:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 16:59:04,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:04,049 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:04,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-07-21 16:59:04,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-07-21 16:59:04,250 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:59:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash 512968886, now seen corresponding path program 28 times [2022-07-21 16:59:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:04,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731889671] [2022-07-21 16:59:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 561 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:04,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:04,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731889671] [2022-07-21 16:59:04,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731889671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:04,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045070485] [2022-07-21 16:59:04,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:59:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:04,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:04,874 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:59:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-21 16:59:05,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:59:05,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:05,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 184 conjunts are in the unsatisfiable core [2022-07-21 16:59:05,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:05,170 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:59:05,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:59:05,174 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-21 16:59:06,021 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 16 treesize of output 12 [2022-07-21 16:59:06,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,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 18 treesize of output 20 [2022-07-21 16:59:06,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,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 18 treesize of output 20 [2022-07-21 16:59:06,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:06,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:07,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:07,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:07,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:07,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:59:07,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:07,330 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-21 16:59:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 648 proven. 758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:07,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:09,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3930 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_726| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|)) (<= (+ 20 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3930) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|)) 0))) is different from false [2022-07-21 16:59:09,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:09,398 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-21 16:59:09,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:09,402 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-21 16:59:09,405 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-21 16:59:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 703 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:12,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045070485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:12,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:12,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 46, 46] total 131 [2022-07-21 16:59:12,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446759994] [2022-07-21 16:59:12,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:12,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-21 16:59:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-21 16:59:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1728, Invalid=15304, Unknown=2, NotChecked=258, Total=17292 [2022-07-21 16:59:12,095 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 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-21 16:59:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:15,711 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2022-07-21 16:59:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-21 16:59:15,711 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 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 161 [2022-07-21 16:59:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:15,712 INFO L225 Difference]: With dead ends: 172 [2022-07-21 16:59:15,712 INFO L226 Difference]: Without dead ends: 172 [2022-07-21 16:59:15,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 247 SyntacticMatches, 4 SemanticMatches, 159 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4762 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3655, Invalid=21785, Unknown=4, NotChecked=316, Total=25760 [2022-07-21 16:59:15,713 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 461 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 5805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1770 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:15,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1676 Invalid, 5805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 3662 Invalid, 0 Unknown, 1770 Unchecked, 1.4s Time] [2022-07-21 16:59:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-21 16:59:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2022-07-21 16:59:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.0236686390532543) internal successors, (173), 170 states have internal predecessors, (173), 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-21 16:59:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2022-07-21 16:59:15,715 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 161 [2022-07-21 16:59:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:15,715 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2022-07-21 16:59:15,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 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-21 16:59:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2022-07-21 16:59:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 16:59:15,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:15,715 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:15,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-07-21 16:59:15,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:15,923 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:59:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1277833731, now seen corresponding path program 13 times [2022-07-21 16:59:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928932567] [2022-07-21 16:59:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 561 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:16,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928932567] [2022-07-21 16:59:16,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928932567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048198685] [2022-07-21 16:59:16,507 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:59:16,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:16,508 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:59:16,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-21 16:59:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:16,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-21 16:59:16,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:16,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:59:16,804 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-21 16:59:16,806 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-21 16:59:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 630 proven. 795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:18,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 703 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:20,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048198685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:20,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:20,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 122 [2022-07-21 16:59:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496940830] [2022-07-21 16:59:20,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:20,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-07-21 16:59:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:20,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-07-21 16:59:20,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=13404, Unknown=0, NotChecked=0, Total=15006 [2022-07-21 16:59:20,628 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 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-21 16:59:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:22,901 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2022-07-21 16:59:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 16:59:22,902 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 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 162 [2022-07-21 16:59:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:22,902 INFO L225 Difference]: With dead ends: 171 [2022-07-21 16:59:22,902 INFO L226 Difference]: Without dead ends: 171 [2022-07-21 16:59:22,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6362 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4371, Invalid=22035, Unknown=0, NotChecked=0, Total=26406 [2022-07-21 16:59:22,903 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 933 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 4131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:22,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1327 Invalid, 4131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 3832 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 16:59:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-21 16:59:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-21 16:59:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.017751479289941) internal successors, (172), 170 states have internal predecessors, (172), 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-21 16:59:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2022-07-21 16:59:22,905 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 162 [2022-07-21 16:59:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:22,905 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2022-07-21 16:59:22,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 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-21 16:59:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2022-07-21 16:59:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-21 16:59:22,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:22,906 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:22,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-07-21 16:59:23,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:23,106 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:59:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash 403815490, now seen corresponding path program 14 times [2022-07-21 16:59:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:23,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729718416] [2022-07-21 16:59:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 723 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:23,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729718416] [2022-07-21 16:59:23,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729718416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:23,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297688063] [2022-07-21 16:59:23,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:59:23,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:23,814 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:59:23,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-21 16:59:24,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:59:24,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:24,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-21 16:59:24,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:24,066 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:59:24,066 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-21 16:59:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 800 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:25,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 780 proven. 723 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:26,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297688063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:26,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:26,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 109 [2022-07-21 16:59:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258025477] [2022-07-21 16:59:26,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:26,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-07-21 16:59:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-07-21 16:59:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2153, Invalid=9619, Unknown=0, NotChecked=0, Total=11772 [2022-07-21 16:59:26,570 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 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-21 16:59:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:27,301 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2022-07-21 16:59:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 16:59:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 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 166 [2022-07-21 16:59:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:27,303 INFO L225 Difference]: With dead ends: 261 [2022-07-21 16:59:27,303 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 16:59:27,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4273 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3442, Invalid=13588, Unknown=0, NotChecked=0, Total=17030 [2022-07-21 16:59:27,305 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:27,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 259 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:59:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 16:59:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-07-21 16:59:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0173410404624277) internal successors, (176), 174 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-21 16:59:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2022-07-21 16:59:27,308 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 166 [2022-07-21 16:59:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:27,308 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2022-07-21 16:59:27,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 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-21 16:59:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2022-07-21 16:59:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-21 16:59:27,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:27,309 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:27,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-07-21 16:59:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-07-21 16:59:27,519 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:59:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1922890399, now seen corresponding path program 15 times [2022-07-21 16:59:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456161832] [2022-07-21 16:59:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 630 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:28,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456161832] [2022-07-21 16:59:28,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456161832] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:28,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926005464] [2022-07-21 16:59:28,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:59:28,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:28,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:28,296 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:59:28,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-07-21 16:59:44,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2022-07-21 16:59:44,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:44,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-21 16:59:44,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:44,442 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-21 16:59:44,444 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-21 16:59:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 703 proven. 877 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:46,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 780 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:47,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926005464] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:47,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:47,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44, 44] total 129 [2022-07-21 16:59:47,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141505781] [2022-07-21 16:59:47,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-07-21 16:59:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-07-21 16:59:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2157, Invalid=14613, Unknown=0, NotChecked=0, Total=16770 [2022-07-21 16:59:47,899 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 130 states, 129 states have (on average 3.891472868217054) internal successors, (502), 130 states have internal predecessors, (502), 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-21 16:59:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:50,145 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2022-07-21 16:59:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 16:59:50,159 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 129 states have (on average 3.891472868217054) internal successors, (502), 130 states have internal predecessors, (502), 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 170 [2022-07-21 16:59:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:50,160 INFO L225 Difference]: With dead ends: 178 [2022-07-21 16:59:50,160 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 16:59:50,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6627 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5454, Invalid=24302, Unknown=0, NotChecked=0, Total=29756 [2022-07-21 16:59:50,161 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 1095 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:50,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 684 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 16:59:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 16:59:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2022-07-21 16:59:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 174 states have (on average 1.0172413793103448) internal successors, (177), 175 states have internal predecessors, (177), 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-21 16:59:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2022-07-21 16:59:50,164 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 170 [2022-07-21 16:59:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:50,164 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2022-07-21 16:59:50,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 129 states have (on average 3.891472868217054) internal successors, (502), 130 states have internal predecessors, (502), 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-21 16:59:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2022-07-21 16:59:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-21 16:59:50,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:50,165 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:50,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-07-21 16:59:50,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-07-21 16:59:50,384 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:59:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1445923345, now seen corresponding path program 29 times [2022-07-21 16:59:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:50,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165557167] [2022-07-21 16:59:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 41 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:51,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:51,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165557167] [2022-07-21 16:59:51,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165557167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:51,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122393923] [2022-07-21 16:59:51,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:59:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:51,398 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:59:51,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process