./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-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/cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:50:48,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:50:48,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:50:49,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:50:49,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:50:49,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:50:49,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:50:49,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:50:49,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:50:49,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:50:49,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:50:49,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:50:49,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:50:49,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:50:49,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:50:49,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:50:49,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:50:49,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:50:49,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:50:49,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:50:49,038 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:50:49,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:50:49,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:50:49,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:50:49,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:50:49,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:50:49,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:50:49,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:50:49,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:50:49,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:50:49,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:50:49,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:50:49,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:50:49,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:50:49,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:50:49,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:50:49,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:50:49,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:50:49,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:50:49,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:50:49,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:50:49,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:50:49,066 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:50:49,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:50:49,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:50:49,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:50:49,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:50:49,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:50:49,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:50:49,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:50:49,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:50:49,099 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:50:49,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:50:49,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:50:49,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:50:49,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:50:49,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:50:49,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:50:49,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:50:49,102 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:50:49,102 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 16:50:49,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:50:49,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:50:49,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:50:49,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:50:49,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:50:49,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:50:49,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:50:49,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:50:49,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:50:49,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:50:49,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 16:50:49,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 16:50:49,104 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 -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2022-07-21 16:50:49,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:50:49,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:50:49,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:50:49,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:50:49,450 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:50:49,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-21 16:50:49,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f638281/1802a2a263b34766b83eec0ba3e9da11/FLAG9c8eba2a5 [2022-07-21 16:50:50,058 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:50:50,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-21 16:50:50,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f638281/1802a2a263b34766b83eec0ba3e9da11/FLAG9c8eba2a5 [2022-07-21 16:50:50,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f638281/1802a2a263b34766b83eec0ba3e9da11 [2022-07-21 16:50:50,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:50:50,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:50:50,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:50:50,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:50:50,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:50:50,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c96a532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50, skipping insertion in model container [2022-07-21 16:50:50,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:50:50,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:50:50,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:50:50,803 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:50:50,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:50:50,853 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:50:50,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50 WrapperNode [2022-07-21 16:50:50,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:50:50,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:50:50,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:50:50,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:50:50,861 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:50:50" (1/1) ... [2022-07-21 16:50:50,878 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:50:50" (1/1) ... [2022-07-21 16:50:50,904 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-07-21 16:50:50,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:50:50,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:50:50,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:50:50,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:50:50,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:50:50,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:50:50,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:50:50,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:50:50,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (1/1) ... [2022-07-21 16:50:50,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:50:50,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:50,977 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:50:50,992 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:50:51,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 16:50:51,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 16:50:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 16:50:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:50:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:50:51,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:50:51,154 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:50:51,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:50:51,384 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:50:51,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:50:51,391 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 16:50:51,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:50:51 BoogieIcfgContainer [2022-07-21 16:50:51,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:50:51,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:50:51,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:50:51,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:50:51,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:50:50" (1/3) ... [2022-07-21 16:50:51,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c29263c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:50:51, skipping insertion in model container [2022-07-21 16:50:51,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:50" (2/3) ... [2022-07-21 16:50:51,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c29263c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:50:51, skipping insertion in model container [2022-07-21 16:50:51,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:50:51" (3/3) ... [2022-07-21 16:50:51,401 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2022-07-21 16:50:51,414 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:50:51,415 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-21 16:50:51,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:50:51,473 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@3eb78811, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@340be6c7 [2022-07-21 16:50:51,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-21 16:50:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:51,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:51,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:51,494 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-21 16:50:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:51,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45776170] [2022-07-21 16:50:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:51,723 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:50:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:51,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45776170] [2022-07-21 16:50:51,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45776170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:51,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:51,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:50:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173000891] [2022-07-21 16:50:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:51,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:50:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:51,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:50:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:50:51,762 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:50:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:51,813 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-21 16:50:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:50:51,821 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:50:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:51,828 INFO L225 Difference]: With dead ends: 33 [2022-07-21 16:50:51,828 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 16:50:51,830 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:50:51,834 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:51,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 16:50:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-21 16:50:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 30 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:50:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-21 16:50:51,865 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2022-07-21 16:50:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:51,866 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-21 16:50:51,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-21 16:50:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:51,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:51,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:51,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 16:50:51,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-21 16:50:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:51,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518669243] [2022-07-21 16:50:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:51,963 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:50:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:51,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518669243] [2022-07-21 16:50:51,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518669243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:51,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:51,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:50:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339023128] [2022-07-21 16:50:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:51,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:51,967 INFO L87 Difference]: Start difference. First operand 31 states and 36 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:50:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:52,027 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-21 16:50:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:52,027 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:50:52,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:52,028 INFO L225 Difference]: With dead ends: 30 [2022-07-21 16:50:52,028 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 16:50:52,029 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:50:52,030 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:52,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 16:50:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 16:50:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 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:50:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-21 16:50:52,037 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2022-07-21 16:50:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:52,038 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-21 16:50:52,039 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:50:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-21 16:50:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:52,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:52,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:52,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 16:50:52,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-21 16:50:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:52,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199699456] [2022-07-21 16:50:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:52,101 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:50:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:52,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199699456] [2022-07-21 16:50:52,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199699456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:52,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:52,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:50:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969879602] [2022-07-21 16:50:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:52,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:52,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:52,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:52,104 INFO L87 Difference]: Start difference. First operand 30 states and 35 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:50:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:52,119 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-21 16:50:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:52,120 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:50:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:52,121 INFO L225 Difference]: With dead ends: 53 [2022-07-21 16:50:52,121 INFO L226 Difference]: Without dead ends: 53 [2022-07-21 16:50:52,122 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:50:52,123 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 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:50:52,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-21 16:50:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-21 16:50:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-21 16:50:52,129 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-21 16:50:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:52,129 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-21 16:50:52,129 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:50:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-21 16:50:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:52,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:52,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:52,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 16:50:52,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-21 16:50:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:52,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170358420] [2022-07-21 16:50:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:52,175 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:50:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:52,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170358420] [2022-07-21 16:50:52,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170358420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:52,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:52,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:50:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375720261] [2022-07-21 16:50:52,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:52,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:52,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:52,178 INFO L87 Difference]: Start difference. First operand 33 states and 39 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:50:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:52,225 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-21 16:50:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:52,225 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:50:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:52,226 INFO L225 Difference]: With dead ends: 57 [2022-07-21 16:50:52,226 INFO L226 Difference]: Without dead ends: 57 [2022-07-21 16:50:52,227 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:50:52,228 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:52,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-21 16:50:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-07-21 16:50:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-21 16:50:52,233 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2022-07-21 16:50:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:52,233 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-21 16:50:52,234 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:50:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-21 16:50:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:50:52,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:52,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:52,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 16:50:52,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 629680341, now seen corresponding path program 1 times [2022-07-21 16:50:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:52,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32210953] [2022-07-21 16:50:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:52,352 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:50:52,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:52,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32210953] [2022-07-21 16:50:52,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32210953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:52,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:52,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:50:52,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696964633] [2022-07-21 16:50:52,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:52,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:50:52,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:52,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:50:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:50:52,355 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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:50:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:52,440 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-07-21 16:50:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:50:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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:50:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:52,441 INFO L225 Difference]: With dead ends: 46 [2022-07-21 16:50:52,441 INFO L226 Difference]: Without dead ends: 46 [2022-07-21 16:50:52,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:50:52,443 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:52,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-21 16:50:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-07-21 16:50:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-07-21 16:50:52,448 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 10 [2022-07-21 16:50:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:52,449 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-21 16:50:52,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 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:50:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-07-21 16:50:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:50:52,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:52,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:52,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 16:50:52,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:52,451 INFO L85 PathProgramCache]: Analyzing trace with hash 629680340, now seen corresponding path program 1 times [2022-07-21 16:50:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:52,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72525312] [2022-07-21 16:50:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:52,489 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:50:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:52,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72525312] [2022-07-21 16:50:52,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72525312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:52,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:52,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:50:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106029995] [2022-07-21 16:50:52,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:52,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:50:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:50:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:50:52,492 INFO L87 Difference]: Start difference. First operand 37 states and 46 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:50:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:52,542 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-07-21 16:50:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:50:52,543 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:50:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:52,546 INFO L225 Difference]: With dead ends: 36 [2022-07-21 16:50:52,547 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 16:50:52,548 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:50:52,552 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:52,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 16:50:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 16:50:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 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:50:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-21 16:50:52,556 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2022-07-21 16:50:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:52,557 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-21 16:50:52,557 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:50:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-21 16:50:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:50:52,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:52,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:52,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 16:50:52,558 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745921, now seen corresponding path program 1 times [2022-07-21 16:50:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:52,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693999502] [2022-07-21 16:50:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:52,671 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:50:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:52,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693999502] [2022-07-21 16:50:52,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693999502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:52,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:52,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:50:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760857864] [2022-07-21 16:50:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:52,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:50:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:50:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:50:52,674 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:52,722 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-21 16:50:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:50:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 16:50:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:52,723 INFO L225 Difference]: With dead ends: 35 [2022-07-21 16:50:52,723 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 16:50:52,724 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:50:52,725 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:52,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 16:50:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-21 16:50:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-07-21 16:50:52,737 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-07-21 16:50:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:52,738 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-21 16:50:52,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-07-21 16:50:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:50:52,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:52,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:52,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 16:50:52,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745920, now seen corresponding path program 1 times [2022-07-21 16:50:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18101081] [2022-07-21 16:50:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:52,841 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:50:52,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:52,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18101081] [2022-07-21 16:50:52,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18101081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:52,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:52,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:50:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258701488] [2022-07-21 16:50:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:52,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:50:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:50:52,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:50:52,844 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:52,911 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-21 16:50:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:50:52,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 16:50:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:52,913 INFO L225 Difference]: With dead ends: 41 [2022-07-21 16:50:52,913 INFO L226 Difference]: Without dead ends: 41 [2022-07-21 16:50:52,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:50:52,915 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:52,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-21 16:50:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-07-21 16:50:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 35 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:50:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-21 16:50:52,933 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 11 [2022-07-21 16:50:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:52,934 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-21 16:50:52,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-21 16:50:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:50:52,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:52,941 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:52,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 16:50:52,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-21 16:50:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:52,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610106649] [2022-07-21 16:50:52,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:53,030 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:50:53,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:53,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610106649] [2022-07-21 16:50:53,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610106649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:53,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078248663] [2022-07-21 16:50:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:53,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:53,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:53,036 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:50:53,048 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:50:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:53,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 16:50:53,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:53,176 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:50:53,177 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:50:53,228 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:50:53,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:53,402 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:50:53,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078248663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:53,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:53,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-21 16:50:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583301281] [2022-07-21 16:50:53,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:53,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 16:50:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 16:50:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:50:53,404 INFO L87 Difference]: Start difference. First operand 36 states and 44 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:50:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:53,555 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-07-21 16:50:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:50:53,556 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:50:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:53,557 INFO L225 Difference]: With dead ends: 80 [2022-07-21 16:50:53,558 INFO L226 Difference]: Without dead ends: 80 [2022-07-21 16:50:53,558 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:50:53,560 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:53,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 138 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-21 16:50:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 33. [2022-07-21 16:50:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-21 16:50:53,572 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 11 [2022-07-21 16:50:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:53,573 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-21 16:50:53,581 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:50:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-21 16:50:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 16:50:53,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:53,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:53,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 16:50:53,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:53,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash -467610218, now seen corresponding path program 1 times [2022-07-21 16:50:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:53,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172465408] [2022-07-21 16:50:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:53,828 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:50:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:53,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172465408] [2022-07-21 16:50:53,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172465408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:53,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:53,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:50:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842356616] [2022-07-21 16:50:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:53,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:53,831 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:53,844 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-21 16:50:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 16:50:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:53,845 INFO L225 Difference]: With dead ends: 33 [2022-07-21 16:50:53,845 INFO L226 Difference]: Without dead ends: 33 [2022-07-21 16:50:53,845 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:50:53,846 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:53,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-21 16:50:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-21 16:50:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-21 16:50:53,848 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2022-07-21 16:50:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:53,849 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-21 16:50:53,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-21 16:50:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:50:53,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:53,850 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:53,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 16:50:53,850 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1625875758, now seen corresponding path program 1 times [2022-07-21 16:50:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:53,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037628243] [2022-07-21 16:50:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037628243] [2022-07-21 16:50:53,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037628243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:53,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:53,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:50:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644317376] [2022-07-21 16:50:53,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:53,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:50:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:53,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:50:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:50:53,888 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:50:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:53,909 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-07-21 16:50:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:50:53,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:50:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:53,910 INFO L225 Difference]: With dead ends: 61 [2022-07-21 16:50:53,910 INFO L226 Difference]: Without dead ends: 61 [2022-07-21 16:50:53,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:50:53,911 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:53,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-21 16:50:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-07-21 16:50:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 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:50:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-21 16:50:53,914 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 14 [2022-07-21 16:50:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:53,914 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-21 16:50:53,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:50:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-21 16:50:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:50:53,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:53,915 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 16:50:53,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1968026960, now seen corresponding path program 1 times [2022-07-21 16:50:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:53,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78275] [2022-07-21 16:50:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:53,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:53,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78275] [2022-07-21 16:50:53,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:53,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:53,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:50:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249475699] [2022-07-21 16:50:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:53,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:50:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:53,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:50:53,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:50:53,990 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:50:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:54,070 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-07-21 16:50:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:50:54,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:50:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:54,072 INFO L225 Difference]: With dead ends: 69 [2022-07-21 16:50:54,072 INFO L226 Difference]: Without dead ends: 69 [2022-07-21 16:50:54,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:50:54,083 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:54,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-21 16:50:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-21 16:50:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-21 16:50:54,089 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 14 [2022-07-21 16:50:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:54,089 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-21 16:50:54,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:50:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-21 16:50:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:50:54,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:54,093 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:54,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 16:50:54,093 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1709861522, now seen corresponding path program 1 times [2022-07-21 16:50:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:54,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174478499] [2022-07-21 16:50:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:54,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:54,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174478499] [2022-07-21 16:50:54,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174478499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:54,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:54,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:50:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301655456] [2022-07-21 16:50:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:54,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:50:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:50:54,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:50:54,207 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:50:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:54,440 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-21 16:50:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:50:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:50:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:54,442 INFO L225 Difference]: With dead ends: 81 [2022-07-21 16:50:54,442 INFO L226 Difference]: Without dead ends: 81 [2022-07-21 16:50:54,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-21 16:50:54,442 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:54,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 146 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-21 16:50:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2022-07-21 16:50:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:50:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-07-21 16:50:54,446 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2022-07-21 16:50:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:54,446 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-07-21 16:50:54,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:50:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-07-21 16:50:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:50:54,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:54,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 16:50:54,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011067, now seen corresponding path program 1 times [2022-07-21 16:50:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:54,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950094400] [2022-07-21 16:50:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:54,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:54,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950094400] [2022-07-21 16:50:54,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950094400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:54,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:54,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:50:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459439439] [2022-07-21 16:50:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:54,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:50:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:50:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:50:54,509 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:50:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:54,557 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-07-21 16:50:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:50:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-21 16:50:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:54,560 INFO L225 Difference]: With dead ends: 54 [2022-07-21 16:50:54,560 INFO L226 Difference]: Without dead ends: 54 [2022-07-21 16:50:54,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:50:54,561 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:54,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 79 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-21 16:50:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-21 16:50:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-07-21 16:50:54,571 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2022-07-21 16:50:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:54,572 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-07-21 16:50:54,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:50:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-07-21 16:50:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:50:54,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:54,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:54,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 16:50:54,574 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011066, now seen corresponding path program 1 times [2022-07-21 16:50:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:54,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832890876] [2022-07-21 16:50:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:54,633 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:50:54,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:54,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832890876] [2022-07-21 16:50:54,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832890876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:54,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:54,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 16:50:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560228955] [2022-07-21 16:50:54,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:54,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:50:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:50:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:50:54,635 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:50:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:54,693 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-07-21 16:50:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:50:54,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-21 16:50:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:54,694 INFO L225 Difference]: With dead ends: 66 [2022-07-21 16:50:54,694 INFO L226 Difference]: Without dead ends: 66 [2022-07-21 16:50:54,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 16:50:54,695 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:54,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-21 16:50:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-07-21 16:50:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:50:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-21 16:50:54,698 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2022-07-21 16:50:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:54,698 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-21 16:50:54,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:50:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-21 16:50:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:50:54,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:54,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:54,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 16:50:54,699 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash -879845628, now seen corresponding path program 1 times [2022-07-21 16:50:54,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:54,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272884447] [2022-07-21 16:50:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:54,863 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:50:54,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272884447] [2022-07-21 16:50:54,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272884447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:54,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 16:50:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511676135] [2022-07-21 16:50:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:54,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 16:50:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:54,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 16:50:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:50:54,865 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:50:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:55,043 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-21 16:50:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:50:55,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-21 16:50:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:55,044 INFO L225 Difference]: With dead ends: 67 [2022-07-21 16:50:55,044 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 16:50:55,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-21 16:50:55,045 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:55,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 16:50:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-21 16:50:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 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:50:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-21 16:50:55,047 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 15 [2022-07-21 16:50:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:55,047 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-21 16:50:55,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:50:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-07-21 16:50:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 16:50:55,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:55,048 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:50:55,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 16:50:55,048 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1587978612, now seen corresponding path program 1 times [2022-07-21 16:50:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:55,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028633668] [2022-07-21 16:50:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:55,089 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:50:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:55,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028633668] [2022-07-21 16:50:55,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028633668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:55,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:55,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:50:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288481800] [2022-07-21 16:50:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:55,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:55,091 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:55,104 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-21 16:50:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 16:50:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:55,105 INFO L225 Difference]: With dead ends: 64 [2022-07-21 16:50:55,105 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 16:50:55,106 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:50:55,106 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:55,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 16:50:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-21 16:50:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-21 16:50:55,108 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2022-07-21 16:50:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:55,108 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-21 16:50:55,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-21 16:50:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:50:55,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:55,109 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:50:55,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 16:50:55,110 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:55,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash 980027851, now seen corresponding path program 1 times [2022-07-21 16:50:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:55,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074803061] [2022-07-21 16:50:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:55,219 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:50:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074803061] [2022-07-21 16:50:55,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074803061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932957508] [2022-07-21 16:50:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:55,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:55,224 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:50:55,225 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:50:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:55,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 16:50:55,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:55,390 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:50:55,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:55,514 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:50:55,529 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:50:55,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932957508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:55,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:55,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-21 16:50:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960992194] [2022-07-21 16:50:55,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:55,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 16:50:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:55,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 16:50:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-21 16:50:55,533 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 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:50:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:55,882 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-21 16:50:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 16:50:55,882 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 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 18 [2022-07-21 16:50:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:55,883 INFO L225 Difference]: With dead ends: 63 [2022-07-21 16:50:55,883 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 16:50:55,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-21 16:50:55,884 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:55,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 122 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 16:50:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-07-21 16:50:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-21 16:50:55,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2022-07-21 16:50:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:55,886 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-21 16:50:55,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 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:50:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-21 16:50:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 16:50:55,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:55,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:55,914 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:50:56,095 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,SelfDestructingSolverStorable17 [2022-07-21 16:50:56,096 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash 358816956, now seen corresponding path program 1 times [2022-07-21 16:50:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:56,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653340724] [2022-07-21 16:50:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:56,288 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:50:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:56,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653340724] [2022-07-21 16:50:56,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653340724] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:56,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22975762] [2022-07-21 16:50:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:56,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:56,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:56,292 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:50:56,320 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:50:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:56,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 16:50:56,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:56,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:50:56,411 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:50:56,417 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:50:56,765 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:50:56,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:57,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:50:57,184 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:50:57,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22975762] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:57,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:57,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-07-21 16:50:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748964503] [2022-07-21 16:50:57,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:57,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 16:50:57,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:57,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 16:50:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2022-07-21 16:50:57,187 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:50:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:58,689 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-21 16:50:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:50:58,690 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 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 19 [2022-07-21 16:50:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:58,690 INFO L225 Difference]: With dead ends: 53 [2022-07-21 16:50:58,690 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 16:50:58,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2022-07-21 16:50:58,692 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:58,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 226 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:50:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 16:50:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-21 16:50:58,693 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:50:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-21 16:50:58,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2022-07-21 16:50:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:58,694 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-21 16:50:58,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:50:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-21 16:50:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 16:50:58,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:58,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:58,714 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:50:58,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:58,904 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 316092298, now seen corresponding path program 1 times [2022-07-21 16:50:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:58,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746797186] [2022-07-21 16:50:58,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:50:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746797186] [2022-07-21 16:50:58,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746797186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508044146] [2022-07-21 16:50:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:58,994 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:50:58,995 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:50:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:59,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-21 16:50:59,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:59,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:50:59,089 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:50:59,093 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:50:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:50:59,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:50:59,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508044146] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:59,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:59,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-21 16:50:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488677176] [2022-07-21 16:50:59,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:59,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 16:50:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 16:50:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-21 16:50:59,376 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 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:50:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:59,524 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-21 16:50:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:50:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 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) Word has length 19 [2022-07-21 16:50:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:59,525 INFO L225 Difference]: With dead ends: 25 [2022-07-21 16:50:59,525 INFO L226 Difference]: Without dead ends: 25 [2022-07-21 16:50:59,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-07-21 16:50:59,526 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:59,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-21 16:50:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-21 16:50:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) 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:50:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-21 16:50:59,527 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-07-21 16:50:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:59,527 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-21 16:50:59,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 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:50:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-21 16:50:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 16:50:59,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:59,528 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:59,554 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:50:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:59,729 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:50:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2137348900, now seen corresponding path program 2 times [2022-07-21 16:50:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:59,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421919902] [2022-07-21 16:50:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:59,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421919902] [2022-07-21 16:50:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421919902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745847785] [2022-07-21 16:50:59,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:50:59,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:59,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:59,960 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:50:59,961 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:51:00,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:51:00,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:00,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 16:51:00,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:00,039 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:51:00,085 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:51:00,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:00,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:00,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-21 16:51:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:00,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:00,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1))) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-21 16:51:00,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (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_243) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)))) is different from false [2022-07-21 16:51:00,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:00,851 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:51:00,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:00,860 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:51:00,866 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:51:00,878 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:51:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 16:51:01,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745847785] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:01,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:01,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-21 16:51:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395491289] [2022-07-21 16:51:01,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:01,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 16:51:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 16:51:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=952, Unknown=3, NotChecked=126, Total=1190 [2022-07-21 16:51:01,007 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:51:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:01,598 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-21 16:51:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:51:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 16:51:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:01,599 INFO L225 Difference]: With dead ends: 46 [2022-07-21 16:51:01,600 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 16:51:01,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=1783, Unknown=3, NotChecked=174, Total=2162 [2022-07-21 16:51:01,601 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:01,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 127 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-07-21 16:51:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 16:51:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-21 16:51:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) 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:51:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-21 16:51:01,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2022-07-21 16:51:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:01,603 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-21 16:51:01,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:51:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-21 16:51:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 16:51:01,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:01,604 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:01,628 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:51:01,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:01,804 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 269887706, now seen corresponding path program 3 times [2022-07-21 16:51:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:01,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281286799] [2022-07-21 16:51:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:02,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:02,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281286799] [2022-07-21 16:51:02,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281286799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:02,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503304005] [2022-07-21 16:51:02,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:51:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:02,071 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:51:02,073 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:51:02,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 16:51:02,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:02,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-21 16:51:02,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:02,197 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:51:02,305 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:51:02,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:02,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:02,468 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:51:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:02,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:02,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:51:02,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:02,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:02,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:02,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_283) |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:51:02,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:02,516 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:51:02,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:02,523 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:51:02,526 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:51:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-21 16:51:02,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503304005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:02,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:02,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2022-07-21 16:51:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034715975] [2022-07-21 16:51:02,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:02,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 16:51:02,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 16:51:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=727, Unknown=5, NotChecked=290, Total=1122 [2022-07-21 16:51:02,689 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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:51:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:03,063 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-21 16:51:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 16:51:03,066 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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) Word has length 30 [2022-07-21 16:51:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:03,066 INFO L225 Difference]: With dead ends: 52 [2022-07-21 16:51:03,066 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 16:51:03,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1063, Unknown=5, NotChecked=350, Total=1560 [2022-07-21 16:51:03,067 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:03,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-21 16:51:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 16:51:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-21 16:51:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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:51:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-21 16:51:03,068 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-07-21 16:51:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:03,069 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-21 16:51:03,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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:51:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-21 16:51:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 16:51:03,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:03,069 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:51:03,101 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:51:03,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:03,280 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash -826784969, now seen corresponding path program 4 times [2022-07-21 16:51:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:03,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68725435] [2022-07-21 16:51:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:03,424 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:51:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:03,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68725435] [2022-07-21 16:51:03,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68725435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:03,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858470204] [2022-07-21 16:51:03,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:51:03,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:03,426 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:51:03,445 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:51:03,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:51:03,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:03,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-21 16:51:03,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:03,529 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:51:03,533 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:51:03,695 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:51:03,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:03,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 18 treesize of output 20 [2022-07-21 16:51:03,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:03,983 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 21 treesize of output 21 [2022-07-21 16:51:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:04,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:04,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:04,558 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:51:04,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:04,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:51:04,575 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:51:04,850 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:51:04,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858470204] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:04,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:04,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2022-07-21 16:51:04,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174937927] [2022-07-21 16:51:04,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:04,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 16:51:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:04,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 16:51:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1518, Unknown=2, NotChecked=0, Total=1722 [2022-07-21 16:51:04,853 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 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:51:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:05,734 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-21 16:51:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 16:51:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 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:51:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:05,734 INFO L225 Difference]: With dead ends: 43 [2022-07-21 16:51:05,734 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 16:51:05,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=491, Invalid=2925, Unknown=6, NotChecked=0, Total=3422 [2022-07-21 16:51:05,736 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:05,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 172 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 348 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-07-21 16:51:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 16:51:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-21 16:51:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) 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:51:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-21 16:51:05,738 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-21 16:51:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:05,738 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-21 16:51:05,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 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:51:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-21 16:51:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 16:51:05,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:05,739 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:05,760 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:51:05,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:05,948 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2031773033, now seen corresponding path program 5 times [2022-07-21 16:51:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:05,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583650670] [2022-07-21 16:51:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:06,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583650670] [2022-07-21 16:51:06,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583650670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:06,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877693507] [2022-07-21 16:51:06,118 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:51:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:06,119 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:51:06,119 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:51:06,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-21 16:51:06,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:06,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 16:51:06,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:06,274 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:51:06,274 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:51:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:06,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:06,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877693507] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:06,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:06,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-07-21 16:51:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064637086] [2022-07-21 16:51:06,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:06,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 16:51:06,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 16:51:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2022-07-21 16:51:06,748 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 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:51:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:07,139 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-21 16:51:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 16:51:07,139 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 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 42 [2022-07-21 16:51:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:07,139 INFO L225 Difference]: With dead ends: 70 [2022-07-21 16:51:07,139 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 16:51:07,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-07-21 16:51:07,140 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:07,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 101 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:51:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 16:51:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-21 16:51:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) 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:51:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-21 16:51:07,142 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-07-21 16:51:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:07,143 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-21 16:51:07,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 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:51:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-21 16:51:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 16:51:07,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:07,144 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:07,163 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:51:07,351 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,SelfDestructingSolverStorable23 [2022-07-21 16:51:07,352 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1224662086, now seen corresponding path program 6 times [2022-07-21 16:51:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:07,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841457281] [2022-07-21 16:51:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:07,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841457281] [2022-07-21 16:51:07,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841457281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:07,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123865467] [2022-07-21 16:51:07,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:51:07,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:07,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:07,795 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:51:07,795 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:51:07,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-21 16:51:07,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:07,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-21 16:51:07,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:07,953 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:51:08,154 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:51:08,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 17 treesize of output 19 [2022-07-21 16:51:08,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:08,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:08,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:08,472 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:51:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:08,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:08,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:51:08,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)))) is different from false [2022-07-21 16:51:08,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_434) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:08,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:08,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_433) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:08,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:08,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_432) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:08,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:08,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_435) |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:51:08,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:08,553 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:51:08,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:08,561 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:51:08,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:51:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-07-21 16:51:08,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123865467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:08,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:08,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 50 [2022-07-21 16:51:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828244687] [2022-07-21 16:51:08,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:08,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 16:51:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 16:51:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1525, Unknown=9, NotChecked=774, Total=2450 [2022-07-21 16:51:08,767 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:51:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:09,501 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-21 16:51:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 16:51:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 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 46 [2022-07-21 16:51:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:09,502 INFO L225 Difference]: With dead ends: 76 [2022-07-21 16:51:09,503 INFO L226 Difference]: Without dead ends: 54 [2022-07-21 16:51:09,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=2464, Unknown=9, NotChecked=972, Total=3660 [2022-07-21 16:51:09,504 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:09,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 396 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 756 Invalid, 0 Unknown, 400 Unchecked, 0.3s Time] [2022-07-21 16:51:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-21 16:51:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-21 16:51:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:51:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-21 16:51:09,506 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-07-21 16:51:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:09,506 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-21 16:51:09,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:51:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-21 16:51:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 16:51:09,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:09,507 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:51:09,526 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:51:09,715 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,SelfDestructingSolverStorable24 [2022-07-21 16:51:09,715 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash 300063907, now seen corresponding path program 7 times [2022-07-21 16:51:09,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:09,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980386607] [2022-07-21 16:51:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:09,935 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:51:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:09,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980386607] [2022-07-21 16:51:09,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980386607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:09,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244406239] [2022-07-21 16:51:09,936 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:51:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:09,938 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:51:09,969 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:51:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:10,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-21 16:51:10,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:10,242 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:51:10,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:10,489 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:51:10,525 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:51:10,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244406239] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:10,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:10,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-21 16:51:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130615966] [2022-07-21 16:51:10,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:10,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 16:51:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:10,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 16:51:10,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 16:51:10,528 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:51:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:10,980 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-21 16:51:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 16:51:10,981 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 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:51:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:10,981 INFO L225 Difference]: With dead ends: 57 [2022-07-21 16:51:10,981 INFO L226 Difference]: Without dead ends: 57 [2022-07-21 16:51:10,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-21 16:51:10,982 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 134 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:10,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 192 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:51:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-21 16:51:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-21 16:51:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) 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:51:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-21 16:51:10,985 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-07-21 16:51:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:10,985 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-21 16:51:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:51:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-21 16:51:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 16:51:10,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:10,986 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:11,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 16:51:11,195 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,SelfDestructingSolverStorable25 [2022-07-21 16:51:11,195 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash -265764356, now seen corresponding path program 8 times [2022-07-21 16:51:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:11,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869350061] [2022-07-21 16:51:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:11,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869350061] [2022-07-21 16:51:11,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869350061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338038041] [2022-07-21 16:51:11,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:51:11,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:11,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:11,750 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:51:11,751 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:51:11,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:51:11,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:11,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-21 16:51:11,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:11,861 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:51:12,051 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:51:12,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:51:12,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:12,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:12,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:12,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:13,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:13,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-21 16:51:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:13,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:14,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-21 16:51:14,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (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_556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-21 16:51:14,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:14,098 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:51:14,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:14,107 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:51:14,112 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:51:14,126 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:51:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-21 16:51:14,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338038041] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:14,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:14,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 75 [2022-07-21 16:51:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178773520] [2022-07-21 16:51:14,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:14,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-21 16:51:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-21 16:51:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=4890, Unknown=7, NotChecked=286, Total=5550 [2022-07-21 16:51:14,588 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:51:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:18,726 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-21 16:51:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-21 16:51:18,727 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 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 54 [2022-07-21 16:51:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:18,727 INFO L225 Difference]: With dead ends: 94 [2022-07-21 16:51:18,727 INFO L226 Difference]: Without dead ends: 68 [2022-07-21 16:51:18,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=800, Invalid=9503, Unknown=7, NotChecked=402, Total=10712 [2022-07-21 16:51:18,730 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:18,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 430 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 602 Unchecked, 0.2s Time] [2022-07-21 16:51:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-21 16:51:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-07-21 16:51:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.032258064516129) 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:51:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-21 16:51:18,733 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 54 [2022-07-21 16:51:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:18,733 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-21 16:51:18,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:51:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-21 16:51:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 16:51:18,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:18,734 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:18,757 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:51:18,947 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,SelfDestructingSolverStorable26 [2022-07-21 16:51:18,948 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:18,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1063800910, now seen corresponding path program 9 times [2022-07-21 16:51:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:18,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330617697] [2022-07-21 16:51:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:19,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330617697] [2022-07-21 16:51:19,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330617697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:19,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282424518] [2022-07-21 16:51:19,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:51:19,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:19,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:19,604 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:51:19,605 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:51:19,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-21 16:51:19,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:19,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-21 16:51:19,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:19,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:51:20,019 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:51:20,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:20,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:20,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:20,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 14 treesize of output 16 [2022-07-21 16:51:20,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:20,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:20,585 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:51:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:20,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:20,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:51:20,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:20,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_631) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:20,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_630) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_629) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_628) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_627) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:20,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_632) |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:51:20,697 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:20,697 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:51:20,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:20,708 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:51:20,711 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:51:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 83 not checked. [2022-07-21 16:51:21,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282424518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:21,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:21,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 27] total 69 [2022-07-21 16:51:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019037575] [2022-07-21 16:51:21,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:21,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-21 16:51:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:21,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-21 16:51:21,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-21 16:51:21,159 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 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:51:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:22,553 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-21 16:51:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 16:51:22,554 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-21 16:51:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:22,554 INFO L225 Difference]: With dead ends: 100 [2022-07-21 16:51:22,554 INFO L226 Difference]: Without dead ends: 70 [2022-07-21 16:51:22,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 85 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=288, Invalid=4581, Unknown=13, NotChecked=1924, Total=6806 [2022-07-21 16:51:22,556 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:22,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 573 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1303 Invalid, 0 Unknown, 678 Unchecked, 0.5s Time] [2022-07-21 16:51:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-21 16:51:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-21 16:51:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:51:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-07-21 16:51:22,558 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-07-21 16:51:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:22,559 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-07-21 16:51:22,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 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:51:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-07-21 16:51:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 16:51:22,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:22,560 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:51:22,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 16:51:22,767 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,SelfDestructingSolverStorable27 [2022-07-21 16:51:22,767 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash 397481487, now seen corresponding path program 10 times [2022-07-21 16:51:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:22,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428525516] [2022-07-21 16:51:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:23,062 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:51:23,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:23,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428525516] [2022-07-21 16:51:23,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428525516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:23,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756977300] [2022-07-21 16:51:23,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:51:23,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:23,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:23,065 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:51:23,066 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:51:23,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:51:23,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:23,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-21 16:51:23,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:23,186 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:51:23,186 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:51:23,193 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:51:23,520 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:51:23,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:23,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:23,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:24,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:51:24,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:24,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 18 treesize of output 20 [2022-07-21 16:51:24,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:24,315 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 21 treesize of output 21 [2022-07-21 16:51:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 72 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:24,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:25,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-21 16:51:25,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (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_713) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0))) is different from false [2022-07-21 16:51:25,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:25,501 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:51:25,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:25,508 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:51:25,516 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:51:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-21 16:51:26,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756977300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:26,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:26,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 28] total 74 [2022-07-21 16:51:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089939967] [2022-07-21 16:51:26,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:26,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-21 16:51:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:26,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-21 16:51:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4717, Unknown=7, NotChecked=286, Total=5550 [2022-07-21 16:51:26,660 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:51:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:28,980 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-21 16:51:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 16:51:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 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:51:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:28,982 INFO L225 Difference]: With dead ends: 75 [2022-07-21 16:51:28,982 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 16:51:28,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1406, Invalid=8453, Unknown=49, NotChecked=394, Total=10302 [2022-07-21 16:51:28,984 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:28,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 428 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 940 Invalid, 0 Unknown, 532 Unchecked, 0.5s Time] [2022-07-21 16:51:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 16:51:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-21 16:51:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) 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:51:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-21 16:51:28,986 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-21 16:51:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:28,986 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-21 16:51:28,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:51:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-21 16:51:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 16:51:28,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:28,988 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:29,005 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:51:29,191 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,SelfDestructingSolverStorable28 [2022-07-21 16:51:29,191 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2032213951, now seen corresponding path program 11 times [2022-07-21 16:51:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:29,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778915389] [2022-07-21 16:51:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 139 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:29,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778915389] [2022-07-21 16:51:29,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778915389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:29,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399698004] [2022-07-21 16:51:29,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:51:29,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:29,484 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:51:29,485 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:51:29,866 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-21 16:51:29,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:29,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-21 16:51:29,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:29,892 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:51:29,892 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:51:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:30,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:30,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399698004] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:30,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:30,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2022-07-21 16:51:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301505988] [2022-07-21 16:51:30,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:30,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 16:51:30,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:30,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 16:51:30,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2138, Unknown=0, NotChecked=0, Total=2550 [2022-07-21 16:51:30,863 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:51:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:31,538 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-07-21 16:51:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:51:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 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:51:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:31,539 INFO L225 Difference]: With dead ends: 118 [2022-07-21 16:51:31,539 INFO L226 Difference]: Without dead ends: 82 [2022-07-21 16:51:31,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=894, Invalid=3936, Unknown=0, NotChecked=0, Total=4830 [2022-07-21 16:51:31,540 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 119 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:31,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 154 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:51:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-21 16:51:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-21 16:51:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) 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:51:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-21 16:51:31,542 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-07-21 16:51:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:31,543 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-21 16:51:31,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:51:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-21 16:51:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 16:51:31,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:31,544 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:31,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-21 16:51:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:31,755 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -626482402, now seen corresponding path program 12 times [2022-07-21 16:51:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829870034] [2022-07-21 16:51:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:32,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829870034] [2022-07-21 16:51:32,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829870034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:32,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929790068] [2022-07-21 16:51:32,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:51:32,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:32,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:32,793 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:51:32,794 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:51:33,403 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-21 16:51:33,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:33,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-21 16:51:33,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:33,418 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:51:33,821 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:51:33,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:51:34,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:51:34,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:34,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:34,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:34,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 16 treesize of output 18 [2022-07-21 16:51:34,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:34,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:34,356 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:51:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:34,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:34,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:51:34,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:34,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_885) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:34,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_884) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_883) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_882) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_881) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_879) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:34,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_886) |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:51:34,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:34,494 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:51:34,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:34,501 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:51:34,504 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:51:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 143 not checked. [2022-07-21 16:51:34,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929790068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:34,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 80 [2022-07-21 16:51:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513181540] [2022-07-21 16:51:34,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:34,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-21 16:51:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-21 16:51:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3735, Unknown=17, NotChecked=2346, Total=6320 [2022-07-21 16:51:34,864 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:51:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:36,682 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2022-07-21 16:51:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 16:51:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 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 78 [2022-07-21 16:51:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:36,683 INFO L225 Difference]: With dead ends: 124 [2022-07-21 16:51:36,683 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 16:51:36,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=353, Invalid=6504, Unknown=17, NotChecked=3026, Total=9900 [2022-07-21 16:51:36,685 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:36,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 808 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1731 Invalid, 0 Unknown, 1153 Unchecked, 0.6s Time] [2022-07-21 16:51:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 16:51:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-07-21 16:51:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:51:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-07-21 16:51:36,687 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-07-21 16:51:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:36,687 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-07-21 16:51:36,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:51:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-07-21 16:51:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 16:51:36,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:36,689 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:36,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-21 16:51:36,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:36,899 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash -605311109, now seen corresponding path program 13 times [2022-07-21 16:51:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:36,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462199212] [2022-07-21 16:51:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:36,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462199212] [2022-07-21 16:51:37,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462199212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885190777] [2022-07-21 16:51:37,329 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:51:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:37,332 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:51:37,337 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:51:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:37,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-21 16:51:37,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:37,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:38,267 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:51:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885190777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:38,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:38,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 50 [2022-07-21 16:51:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164416491] [2022-07-21 16:51:38,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:38,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 16:51:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 16:51:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2022-07-21 16:51:38,332 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:51:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:39,219 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-07-21 16:51:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 16:51:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 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 82 [2022-07-21 16:51:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:39,220 INFO L225 Difference]: With dead ends: 89 [2022-07-21 16:51:39,220 INFO L226 Difference]: Without dead ends: 89 [2022-07-21 16:51:39,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2022-07-21 16:51:39,221 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 381 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:39,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 364 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 16:51:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-21 16:51:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-21 16:51:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:51:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-21 16:51:39,223 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-07-21 16:51:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:39,224 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-21 16:51:39,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:51:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-21 16:51:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-21 16:51:39,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:39,225 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:39,245 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:51:39,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:39,436 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1757632300, now seen corresponding path program 14 times [2022-07-21 16:51:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396625068] [2022-07-21 16:51:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:40,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:40,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396625068] [2022-07-21 16:51:40,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396625068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:40,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020635849] [2022-07-21 16:51:40,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:51:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:40,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:40,672 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:51:40,673 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:51:40,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:51:40,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:40,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 169 conjunts are in the unsatisfiable core [2022-07-21 16:51:40,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:40,824 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:51:41,204 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:51:41,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:51:41,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 17 treesize of output 19 [2022-07-21 16:51:41,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:41,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:42,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:42,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 17 treesize of output 19 [2022-07-21 16:51:42,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:42,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:42,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:43,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:43,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-21 16:51:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:43,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:45,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-21 16:51:45,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (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_1074) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|))) is different from false [2022-07-21 16:51:45,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:45,237 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:51:45,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:45,244 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:51:45,247 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:51:45,250 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:51:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-21 16:51:46,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020635849] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:46,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:46,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 115 [2022-07-21 16:51:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329189594] [2022-07-21 16:51:46,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:46,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-07-21 16:51:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:46,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-07-21 16:51:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=11887, Unknown=11, NotChecked=446, Total=13110 [2022-07-21 16:51:46,131 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:51:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:50,242 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-21 16:51:50,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-07-21 16:51:50,243 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 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 86 [2022-07-21 16:51:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:50,244 INFO L225 Difference]: With dead ends: 142 [2022-07-21 16:51:50,244 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 16:51:50,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 4835 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1639, Invalid=23164, Unknown=11, NotChecked=626, Total=25440 [2022-07-21 16:51:50,245 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 107 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1193 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:50,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 775 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 793 Invalid, 0 Unknown, 1193 Unchecked, 0.3s Time] [2022-07-21 16:51:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 16:51:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-07-21 16:51:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:51:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-21 16:51:50,248 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2022-07-21 16:51:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:50,248 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-21 16:51:50,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:51:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-21 16:51:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 16:51:50,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:50,250 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:50,272 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:51:50,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:50,463 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:50,464 INFO L85 PathProgramCache]: Analyzing trace with hash -486951286, now seen corresponding path program 15 times [2022-07-21 16:51:50,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:50,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452370488] [2022-07-21 16:51:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:50,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452370488] [2022-07-21 16:51:51,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452370488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:51,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118841263] [2022-07-21 16:51:51,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:51:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:51,746 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:51:51,749 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:51:53,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-21 16:51:53,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:53,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 188 conjunts are in the unsatisfiable core [2022-07-21 16:51:53,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:53,450 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:51:53,987 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:51:54,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:54,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:54,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:54,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:54,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:54,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:54,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:51:54,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:51:54,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:54,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:51:54,688 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:51:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:54,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:54,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:51:54,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:54,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1184) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:51:54,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1183) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1182) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:51:54,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1181) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1180) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1179) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1178) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:51:54,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:51:54,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1185) |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:51:54,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:54,818 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:51:54,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:51:54,823 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:51:54,827 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:51:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 219 not checked. [2022-07-21 16:51:55,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118841263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:55,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:55,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 39, 39] total 96 [2022-07-21 16:51:55,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981156079] [2022-07-21 16:51:55,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:55,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-21 16:51:55,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:55,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-21 16:51:55,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5347, Unknown=21, NotChecked=3486, Total=9120 [2022-07-21 16:51:55,158 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states 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:51:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:51:57,589 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2022-07-21 16:51:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-21 16:51:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 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 94 [2022-07-21 16:51:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:51:57,590 INFO L225 Difference]: With dead ends: 148 [2022-07-21 16:51:57,590 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 16:51:57,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 137 SyntacticMatches, 21 SemanticMatches, 116 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=398, Invalid=8977, Unknown=21, NotChecked=4410, Total=13806 [2022-07-21 16:51:57,592 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1735 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 16:51:57,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1068 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2380 Invalid, 0 Unknown, 1735 Unchecked, 0.9s Time] [2022-07-21 16:51:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 16:51:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-07-21 16:51:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:51:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-07-21 16:51:57,594 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-07-21 16:51:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:51:57,594 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-07-21 16:51:57,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states 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:51:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-07-21 16:51:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 16:51:57,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:51:57,596 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:51:57,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-21 16:51:57,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:57,815 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:51:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:51:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1113221351, now seen corresponding path program 16 times [2022-07-21 16:51:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:51:57,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402488638] [2022-07-21 16:51:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:51:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:51:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:51:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 153 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:51:58,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:51:58,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402488638] [2022-07-21 16:51:58,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402488638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:51:58,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847070171] [2022-07-21 16:51:58,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:51:58,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:51:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:51:58,376 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:51:58,410 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:51:58,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:51:58,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:51:58,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 192 conjunts are in the unsatisfiable core [2022-07-21 16:51:58,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:51:58,644 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:51:58,645 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:51:58,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 10 treesize of output 8 [2022-07-21 16:51:59,359 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:51:59,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 18 treesize of output 20 [2022-07-21 16:51:59,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:59,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:59,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:59,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:00,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:52:00,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:00,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:00,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:00,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:00,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:00,785 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 21 treesize of output 21 [2022-07-21 16:52:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 200 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:00,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:02,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-21 16:52:02,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (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_1303) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-21 16:52:03,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:03,003 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:52:03,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:03,012 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:52:03,015 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:52:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-21 16:52:05,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847070171] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:05,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:05,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 40, 40] total 106 [2022-07-21 16:52:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624136547] [2022-07-21 16:52:05,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-07-21 16:52:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-07-21 16:52:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=9837, Unknown=11, NotChecked=414, Total=11342 [2022-07-21 16:52:05,023 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:52:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:09,366 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-21 16:52:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-21 16:52:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 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 98 [2022-07-21 16:52:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:09,368 INFO L225 Difference]: With dead ends: 107 [2022-07-21 16:52:09,368 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 16:52:09,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 118 SyntacticMatches, 13 SemanticMatches, 142 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3854 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2860, Invalid=17094, Unknown=76, NotChecked=562, Total=20592 [2022-07-21 16:52:09,369 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 266 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1168 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:09,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 868 Invalid, 3136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1724 Invalid, 0 Unknown, 1168 Unchecked, 0.8s Time] [2022-07-21 16:52:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 16:52:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-21 16:52:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:52:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-07-21 16:52:09,370 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 98 [2022-07-21 16:52:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:09,371 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-07-21 16:52:09,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:52:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-07-21 16:52:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 16:52:09,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:09,372 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:09,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-21 16:52:09,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:09,587 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:52:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -36447463, now seen corresponding path program 17 times [2022-07-21 16:52:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:09,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263847595] [2022-07-21 16:52:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 303 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:10,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:10,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263847595] [2022-07-21 16:52:10,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263847595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:10,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026191924] [2022-07-21 16:52:10,109 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:52:10,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:10,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:10,110 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:52:10,111 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:52:12,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-21 16:52:12,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:12,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-21 16:52:12,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:12,495 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:52:12,496 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:52:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:13,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:14,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026191924] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:14,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:14,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 29] total 72 [2022-07-21 16:52:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253312144] [2022-07-21 16:52:14,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:14,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-21 16:52:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:14,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-21 16:52:14,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=4233, Unknown=0, NotChecked=0, Total=5112 [2022-07-21 16:52:14,279 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 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:52:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:14,986 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2022-07-21 16:52:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 16:52:14,987 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 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 106 [2022-07-21 16:52:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:14,988 INFO L225 Difference]: With dead ends: 166 [2022-07-21 16:52:14,988 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 16:52:14,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1509, Invalid=6147, Unknown=0, NotChecked=0, Total=7656 [2022-07-21 16:52:14,989 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:14,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 242 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:52:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 16:52:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-07-21 16:52:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:52:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-07-21 16:52:14,991 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-07-21 16:52:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:14,992 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-07-21 16:52:14,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 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:52:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-07-21 16:52:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 16:52:14,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:14,993 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:15,021 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:52:15,200 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,SelfDestructingSolverStorable35 [2022-07-21 16:52:15,201 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:52:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash 223537654, now seen corresponding path program 18 times [2022-07-21 16:52:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:15,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191692543] [2022-07-21 16:52:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:16,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191692543] [2022-07-21 16:52:16,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191692543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:16,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041458074] [2022-07-21 16:52:16,966 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:52:16,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:16,968 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:52:16,969 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:52:20,592 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-21 16:52:20,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:20,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 290 conjunts are in the unsatisfiable core [2022-07-21 16:52:20,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:20,617 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:52:21,575 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:52:21,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:21,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:22,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:22,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:22,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:22,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:22,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:23,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:23,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 16 treesize of output 18 [2022-07-21 16:52:23,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:52:23,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:23,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:23,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:52:23,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:23,885 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:52:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:23,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:23,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:52:23,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:52:23,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1543) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:52:23,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1542) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1541 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1541) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1540 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1540) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:52:23,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1539) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1538) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1537) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:52:23,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1536) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:23,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:52:24,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1535) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:52:24,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1534) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:52:24,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:52:24,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1533) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:52:24,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1544) |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:52:24,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:24,035 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:52:24,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:24,040 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:52:24,043 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:52:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 311 not checked. [2022-07-21 16:52:25,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041458074] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:25,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:25,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 139 [2022-07-21 16:52:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575947928] [2022-07-21 16:52:25,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:25,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-21 16:52:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-21 16:52:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=12535, Unknown=25, NotChecked=6200, Total=19182 [2022-07-21 16:52:25,029 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:52:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:28,346 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2022-07-21 16:52:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-21 16:52:28,347 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 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 110 [2022-07-21 16:52:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:28,348 INFO L225 Difference]: With dead ends: 172 [2022-07-21 16:52:28,348 INFO L226 Difference]: Without dead ends: 118 [2022-07-21 16:52:28,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 142 SyntacticMatches, 13 SemanticMatches, 170 ConstructedPredicates, 25 IntricatePredicates, 7 DeprecatedPredicates, 6609 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=653, Invalid=20884, Unknown=25, NotChecked=7850, Total=29412 [2022-07-21 16:52:28,350 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 4928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2923 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:28,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1759 Invalid, 4928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1989 Invalid, 0 Unknown, 2923 Unchecked, 0.7s Time] [2022-07-21 16:52:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-21 16:52:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-07-21 16:52:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 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:52:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-21 16:52:28,353 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-07-21 16:52:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:28,353 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-21 16:52:28,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:52:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-21 16:52:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 16:52:28,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:28,354 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:28,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-21 16:52:28,567 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,SelfDestructingSolverStorable36 [2022-07-21 16:52:28,567 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:52:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash 382026323, now seen corresponding path program 19 times [2022-07-21 16:52:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:28,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774580179] [2022-07-21 16:52:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 231 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:29,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774580179] [2022-07-21 16:52:29,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774580179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:29,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112976304] [2022-07-21 16:52:29,205 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:52:29,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:29,208 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:52:29,209 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:52:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:29,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-21 16:52:29,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:30,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:30,772 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:52:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:30,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112976304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:30,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:30,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 65 [2022-07-21 16:52:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625137520] [2022-07-21 16:52:30,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:30,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-21 16:52:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-21 16:52:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3886, Unknown=0, NotChecked=0, Total=4290 [2022-07-21 16:52:30,847 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 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:52:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:32,908 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-07-21 16:52:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 16:52:32,909 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 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 114 [2022-07-21 16:52:32,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:32,909 INFO L225 Difference]: With dead ends: 121 [2022-07-21 16:52:32,909 INFO L226 Difference]: Without dead ends: 121 [2022-07-21 16:52:32,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2253, Invalid=9303, Unknown=0, NotChecked=0, Total=11556 [2022-07-21 16:52:32,910 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 442 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:32,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 696 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 16:52:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-21 16:52:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-07-21 16:52:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:52:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-21 16:52:32,913 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-21 16:52:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:32,913 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-21 16:52:32,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 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:52:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-21 16:52:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 16:52:32,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:32,915 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:32,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-21 16:52:33,119 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,SelfDestructingSolverStorable37 [2022-07-21 16:52:33,119 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:52:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash -757002324, now seen corresponding path program 20 times [2022-07-21 16:52:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:33,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956069520] [2022-07-21 16:52:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:35,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956069520] [2022-07-21 16:52:35,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956069520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:35,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722247140] [2022-07-21 16:52:35,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:52:35,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:35,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:35,030 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:52:35,032 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:52:35,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:52:35,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:35,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 227 conjunts are in the unsatisfiable core [2022-07-21 16:52:35,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:35,263 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:52:35,987 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:52:36,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:52:36,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:36,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:36,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:37,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:37,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:37,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:37,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:52:37,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:38,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:38,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:38,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:38,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:52:39,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:39,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-21 16:52:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:39,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:40,390 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1801 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) (and (<= (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (<= 0 (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:52:42,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:52:42,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0))) is different from false [2022-07-21 16:52:42,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:42,772 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:52:42,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:42,779 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:52:42,782 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:52:42,786 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:52:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 401 refuted. 0 times theorem prover too weak. 0 trivial. 40 not checked. [2022-07-21 16:52:44,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722247140] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:44,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:44,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 155 [2022-07-21 16:52:44,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843476577] [2022-07-21 16:52:44,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:44,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-07-21 16:52:44,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:44,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-07-21 16:52:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=21665, Unknown=14, NotChecked=906, Total=23870 [2022-07-21 16:52:44,315 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:52:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:55,189 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-21 16:52:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-07-21 16:52:55,189 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 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 118 [2022-07-21 16:52:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:55,190 INFO L225 Difference]: With dead ends: 190 [2022-07-21 16:52:55,190 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 16:52:55,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 160 SyntacticMatches, 10 SemanticMatches, 219 ConstructedPredicates, 3 IntricatePredicates, 6 DeprecatedPredicates, 10001 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=2810, Invalid=44494, Unknown=14, NotChecked=1302, Total=48620 [2022-07-21 16:52:55,192 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 181 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1268 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:55,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1597 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1543 Invalid, 0 Unknown, 1268 Unchecked, 0.6s Time] [2022-07-21 16:52:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 16:52:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-21 16:52:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 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:52:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-07-21 16:52:55,202 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2022-07-21 16:52:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:55,203 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-07-21 16:52:55,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:52:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-07-21 16:52:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-21 16:52:55,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:55,206 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:55,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-21 16:52:55,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:55,406 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:52:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1971076450, now seen corresponding path program 21 times [2022-07-21 16:52:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:55,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010712613] [2022-07-21 16:52:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:57,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:57,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010712613] [2022-07-21 16:52:57,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010712613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:57,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104802426] [2022-07-21 16:52:57,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:52:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:57,463 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:52:57,464 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:53:04,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-21 16:53:04,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:04,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 328 conjunts are in the unsatisfiable core [2022-07-21 16:53:04,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:04,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 10 treesize of output 8 [2022-07-21 16:53:05,665 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:53:05,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:53:06,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:06,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:53:06,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:06,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:06,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:53:07,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:07,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:07,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:07,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:07,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:08,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:53:08,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:08,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:08,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:53:08,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:08,614 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:53:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:08,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:08,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:53:08,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:53:08,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1947) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:53:08,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1946) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1945) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1944) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1943) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1942) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1941 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1941) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1940) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:53:08,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1939) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:53:08,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1938) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:53:08,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:53:08,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1937) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:53:08,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1936) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1935) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:08,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1948) |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:53:08,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:08,830 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:53:08,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:08,836 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:53:08,839 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:53:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 419 not checked. [2022-07-21 16:53:10,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104802426] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:10,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:10,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 51, 51] total 159 [2022-07-21 16:53:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677934097] [2022-07-21 16:53:10,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:10,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-07-21 16:53:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-07-21 16:53:10,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=16375, Unknown=29, NotChecked=8236, Total=25122 [2022-07-21 16:53:10,067 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:53:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:14,546 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2022-07-21 16:53:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-21 16:53:14,547 INFO L78 Accepts]: Start accepts. Automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 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 126 [2022-07-21 16:53:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:14,548 INFO L225 Difference]: With dead ends: 196 [2022-07-21 16:53:14,548 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 16:53:14,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 158 SyntacticMatches, 15 SemanticMatches, 199 ConstructedPredicates, 29 IntricatePredicates, 13 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=775, Invalid=28724, Unknown=29, NotChecked=10672, Total=40200 [2022-07-21 16:53:14,550 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 5212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2725 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:14,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 2245 Invalid, 5212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2470 Invalid, 0 Unknown, 2725 Unchecked, 0.9s Time] [2022-07-21 16:53:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 16:53:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-07-21 16:53:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:53:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-07-21 16:53:14,553 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-07-21 16:53:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:14,554 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-07-21 16:53:14,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:53:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-07-21 16:53:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-21 16:53:14,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:14,555 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:14,587 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:53:14,771 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,SelfDestructingSolverStorable39 [2022-07-21 16:53:14,771 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:53:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash 217332671, now seen corresponding path program 22 times [2022-07-21 16:53:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:14,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214697382] [2022-07-21 16:53:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 325 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:15,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:15,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214697382] [2022-07-21 16:53:15,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214697382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:15,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941156302] [2022-07-21 16:53:15,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:53:15,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:15,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:15,509 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:53:15,510 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:53:15,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:53:15,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:15,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 248 conjunts are in the unsatisfiable core [2022-07-21 16:53:15,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:15,769 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:53:15,774 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:53:16,664 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:53:16,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:17,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:17,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:17,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:17,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 18 treesize of output 20 [2022-07-21 16:53:17,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:17,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:17,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:17,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:18,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:18,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:18,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:53:18,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:53:18,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:53:18,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:18,880 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 21 treesize of output 21 [2022-07-21 16:53:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 392 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:19,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:22,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) 0) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)))) is different from false [2022-07-21 16:53:22,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) is different from false [2022-07-21 16:53:22,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:22,391 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:53:22,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:22,399 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:53:22,403 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:53:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-21 16:53:25,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941156302] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:25,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:25,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 52, 52] total 138 [2022-07-21 16:53:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639673399] [2022-07-21 16:53:25,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:25,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-21 16:53:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-21 16:53:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1813, Invalid=16813, Unknown=14, NotChecked=542, Total=19182 [2022-07-21 16:53:25,341 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:53:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:31,345 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2022-07-21 16:53:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-21 16:53:31,345 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 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 130 [2022-07-21 16:53:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:31,346 INFO L225 Difference]: With dead ends: 139 [2022-07-21 16:53:31,346 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 16:53:31,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 164 SyntacticMatches, 11 SemanticMatches, 186 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6663 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=4968, Invalid=29356, Unknown=94, NotChecked=738, Total=35156 [2022-07-21 16:53:31,349 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 350 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 3726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1823 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:31,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 966 Invalid, 3726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1613 Invalid, 0 Unknown, 1823 Unchecked, 0.8s Time] [2022-07-21 16:53:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 16:53:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-21 16:53:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:53:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-07-21 16:53:31,351 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 130 [2022-07-21 16:53:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:31,352 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-07-21 16:53:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:53:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-07-21 16:53:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 16:53:31,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:31,353 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:31,378 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:53:31,567 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,SelfDestructingSolverStorable40 [2022-07-21 16:53:31,567 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:53:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1547261425, now seen corresponding path program 23 times [2022-07-21 16:53:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561204306] [2022-07-21 16:53:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 531 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:32,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561204306] [2022-07-21 16:53:32,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561204306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:32,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141629315] [2022-07-21 16:53:32,222 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:53:32,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:32,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:32,224 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:53:32,224 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:53:38,965 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-21 16:53:38,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:38,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-21 16:53:38,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:39,000 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:53:39,000 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:53:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:40,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:41,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141629315] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:41,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:41,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 91 [2022-07-21 16:53:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911479744] [2022-07-21 16:53:41,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:41,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-21 16:53:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-21 16:53:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=6882, Unknown=0, NotChecked=0, Total=8190 [2022-07-21 16:53:41,564 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 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:53:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:43,108 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-21 16:53:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 16:53:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 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 138 [2022-07-21 16:53:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:43,110 INFO L225 Difference]: With dead ends: 214 [2022-07-21 16:53:43,110 INFO L226 Difference]: Without dead ends: 146 [2022-07-21 16:53:43,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2802, Invalid=12948, Unknown=0, NotChecked=0, Total=15750 [2022-07-21 16:53:43,112 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 134 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:43,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 249 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 16:53:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-21 16:53:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-07-21 16:53:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:53:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-07-21 16:53:43,114 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2022-07-21 16:53:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:43,115 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-07-21 16:53:43,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 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:53:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-07-21 16:53:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-21 16:53:43,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:43,116 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:43,143 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:53:43,327 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,SelfDestructingSolverStorable41 [2022-07-21 16:53:43,327 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:53:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:43,328 INFO L85 PathProgramCache]: Analyzing trace with hash 524136654, now seen corresponding path program 24 times [2022-07-21 16:53:43,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:43,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160038110] [2022-07-21 16:53:43,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:43,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:45,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160038110] [2022-07-21 16:53:45,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160038110] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:45,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528777970] [2022-07-21 16:53:45,845 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:53:45,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:45,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:45,846 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:53:45,848 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:54:24,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-21 16:54:24,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:54:25,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 284 conjunts are in the unsatisfiable core [2022-07-21 16:54:25,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:54:25,066 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:54:26,237 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:54:26,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:54:26,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:26,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 16 treesize of output 18 [2022-07-21 16:54:26,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:26,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:26,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:26,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:54:27,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:54:27,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:54:27,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 16 treesize of output 18 [2022-07-21 16:54:27,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:27,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:54:27,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 16 treesize of output 18 [2022-07-21 16:54:27,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:27,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:27,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:54:27,755 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:54:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:27,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:54:27,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:54:27,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:54:27,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2411) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:54:27,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:54:27,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2410 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2410) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2409 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2409) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2408) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2407) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2406) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2405) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2404) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2403) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:54:27,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2402) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:54:27,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:54:27,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2401) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)))) is different from false [2022-07-21 16:54:27,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:54:27,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2400 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2400) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2399) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2398 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2398) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:54:27,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2397) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 16 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:27,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2412) |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:54:27,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:27,950 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:54:27,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:27,955 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:54:27,957 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:54:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 543 not checked. [2022-07-21 16:54:28,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528777970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:54:28,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:54:28,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 57, 57] total 146 [2022-07-21 16:54:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825614239] [2022-07-21 16:54:28,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:54:28,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2022-07-21 16:54:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:54:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2022-07-21 16:54:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=12349, Unknown=33, NotChecked=8382, Total=21170 [2022-07-21 16:54:28,495 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:54:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:54:34,983 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2022-07-21 16:54:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-07-21 16:54:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 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 142 [2022-07-21 16:54:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:54:34,984 INFO L225 Difference]: With dead ends: 220 [2022-07-21 16:54:34,984 INFO L226 Difference]: Without dead ends: 150 [2022-07-21 16:54:34,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 205 SyntacticMatches, 51 SemanticMatches, 179 ConstructedPredicates, 33 IntricatePredicates, 1 DeprecatedPredicates, 6480 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=614, Invalid=21241, Unknown=33, NotChecked=10692, Total=32580 [2022-07-21 16:54:34,985 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 5884 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 9882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 5884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3931 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:54:34,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2460 Invalid, 9882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 5884 Invalid, 0 Unknown, 3931 Unchecked, 2.0s Time] [2022-07-21 16:54:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-21 16:54:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-21 16:54:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:54:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-07-21 16:54:34,988 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2022-07-21 16:54:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:54:34,989 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-07-21 16:54:34,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:54:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-07-21 16:54:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 16:54:34,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:54:34,990 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:54:35,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-21 16:54:35,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:35,215 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:54:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:54:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1062251221, now seen corresponding path program 25 times [2022-07-21 16:54:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:54:35,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462428463] [2022-07-21 16:54:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:54:35,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:54:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:54:36,048 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:54:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:54:36,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462428463] [2022-07-21 16:54:36,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462428463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:54:36,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860426525] [2022-07-21 16:54:36,049 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:54:36,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:36,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:54:36,050 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:54:36,051 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:54:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:54:36,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 171 conjunts are in the unsatisfiable core [2022-07-21 16:54:36,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:54:37,050 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:54:37,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:54:37,971 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:54:38,061 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:54:38,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860426525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:54:38,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:54:38,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 82 [2022-07-21 16:54:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787768559] [2022-07-21 16:54:38,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:54:38,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-21 16:54:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:54:38,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-21 16:54:38,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=6030, Unknown=0, NotChecked=0, Total=6806 [2022-07-21 16:54:38,064 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 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:54:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:54:40,317 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2022-07-21 16:54:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-21 16:54:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 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 146 [2022-07-21 16:54:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:54:40,318 INFO L225 Difference]: With dead ends: 153 [2022-07-21 16:54:40,318 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 16:54:40,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3186 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2753, Invalid=11767, Unknown=0, NotChecked=0, Total=14520 [2022-07-21 16:54:40,319 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 297 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 3082 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:54:40,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1027 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3082 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 16:54:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 16:54:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2022-07-21 16:54:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.0133333333333334) 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:54:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-07-21 16:54:40,322 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2022-07-21 16:54:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:54:40,323 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-07-21 16:54:40,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 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:54:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-07-21 16:54:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-21 16:54:40,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:54:40,324 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:54:40,345 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:54:40,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:40,531 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:54:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:54:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2125072764, now seen corresponding path program 26 times [2022-07-21 16:54:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:54:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526845953] [2022-07-21 16:54:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:54:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:54:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:54:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 36 proven. 1173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:54:43,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526845953] [2022-07-21 16:54:43,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526845953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:54:43,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60985852] [2022-07-21 16:54:43,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:54:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:54:43,233 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:54:43,234 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:54:43,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:54:43,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:54:43,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 281 conjunts are in the unsatisfiable core [2022-07-21 16:54:43,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:54:43,512 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:54:44,566 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:54:44,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:54:45,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:45,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:54:45,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:45,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:46,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:46,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:46,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:46,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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