./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.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/cstrcpy-alloca-1.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 fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:50:39,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:50:39,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:50:39,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:50:39,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:50:39,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:50:39,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:50:39,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:50:39,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:50:39,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:50:39,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:50:39,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:50:39,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:50:39,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:50:39,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:50:39,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:50:39,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:50:39,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:50:39,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:50:39,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:50:39,963 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:50:39,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:50:39,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:50:39,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:50:39,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:50:39,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:50:39,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:50:39,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:50:39,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:50:39,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:50:39,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:50:39,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:50:39,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:50:39,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:50:39,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:50:39,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:50:39,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:50:39,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:50:39,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:50:39,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:50:39,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:50:39,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:50:39,974 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:39,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:50:39,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:50:39,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:50:39,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:50:39,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:50:39,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:50:39,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:50:39,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:50:39,991 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:50:39,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:50:39,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:50:39,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:50:39,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:50:39,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:50:39,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:50:39,992 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:50:39,992 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:50:39,993 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 16:50:39,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:50:39,993 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:50:39,993 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:50:39,993 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:50:39,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:50:39,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:50:39,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:50:39,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:50:39,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:50:39,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:50:39,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 16:50:39,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 16:50:39,995 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 -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2022-07-21 16:50:40,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:50:40,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:50:40,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:50:40,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:50:40,303 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:50:40,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-21 16:50:40,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7684dc75f/78e1755a76c146899d1399d382712110/FLAG8ae13d108 [2022-07-21 16:50:40,790 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:50:40,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-21 16:50:40,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7684dc75f/78e1755a76c146899d1399d382712110/FLAG8ae13d108 [2022-07-21 16:50:41,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7684dc75f/78e1755a76c146899d1399d382712110 [2022-07-21 16:50:41,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:50:41,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:50:41,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:50:41,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:50:41,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:50:41,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:50:41" (1/1) ... [2022-07-21 16:50:41,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c00a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:41, skipping insertion in model container [2022-07-21 16:50:41,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:50:41" (1/1) ... [2022-07-21 16:50:41,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:50:41,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:50:41,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:50:41,547 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:50:41,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:50:41,593 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:50:41,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:41 WrapperNode [2022-07-21 16:50:41,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:50:41,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:50:41,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:50:41,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:50:41,601 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:41" (1/1) ... [2022-07-21 16:50:41,619 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:41" (1/1) ... [2022-07-21 16:50:41,637 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-07-21 16:50:41,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:50:41,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:50:41,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:50:41,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:50:41,643 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:41" (1/1) ... [2022-07-21 16:50:41,643 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:41" (1/1) ... [2022-07-21 16:50:41,655 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:41" (1/1) ... [2022-07-21 16:50:41,655 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:41" (1/1) ... [2022-07-21 16:50:41,658 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:41" (1/1) ... [2022-07-21 16:50:41,660 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:41" (1/1) ... [2022-07-21 16:50:41,661 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:41" (1/1) ... [2022-07-21 16:50:41,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:50:41,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:50:41,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:50:41,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:50:41,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:41" (1/1) ... [2022-07-21 16:50:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:50:41,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:41,701 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:41,709 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:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 16:50:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 16:50:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 16:50:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:50:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:50:41,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:50:41,865 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:50:41,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:50:42,078 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:50:42,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:50:42,086 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 16:50:42,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:50:42 BoogieIcfgContainer [2022-07-21 16:50:42,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:50:42,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:50:42,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:50:42,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:50:42,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:50:41" (1/3) ... [2022-07-21 16:50:42,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8fc5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:50:42, skipping insertion in model container [2022-07-21 16:50:42,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:50:41" (2/3) ... [2022-07-21 16:50:42,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8fc5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:50:42, skipping insertion in model container [2022-07-21 16:50:42,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:50:42" (3/3) ... [2022-07-21 16:50:42,095 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2022-07-21 16:50:42,106 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:50:42,107 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-21 16:50:42,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:50:42,162 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@1f213aec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8be1513 [2022-07-21 16:50:42,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-21 16:50:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:50:42,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:42,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:50:42,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:42,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-21 16:50:42,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:42,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515602543] [2022-07-21 16:50:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:42,335 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:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:42,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515602543] [2022-07-21 16:50:42,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515602543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:42,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:42,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:50:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006240452] [2022-07-21 16:50:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:42,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:42,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:42,374 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:42,429 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-21 16:50:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:42,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 16:50:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:42,439 INFO L225 Difference]: With dead ends: 34 [2022-07-21 16:50:42,439 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 16:50:42,441 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:42,444 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:42,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 16:50:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-21 16:50:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 16:50:42,468 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-21 16:50:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:42,469 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 16:50:42,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 16:50:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 16:50:42,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:42,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 16:50:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 16:50:42,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-21 16:50:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:42,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900139056] [2022-07-21 16:50:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:42,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:42,536 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:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:42,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900139056] [2022-07-21 16:50:42,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900139056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:42,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:42,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:50:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923299515] [2022-07-21 16:50:42,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:42,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:50:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:42,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:50:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:50:42,550 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:42,570 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-21 16:50:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:50:42,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 16:50:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:42,587 INFO L225 Difference]: With dead ends: 29 [2022-07-21 16:50:42,588 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 16:50:42,589 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:42,590 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:42,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 16:50:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-21 16:50:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-21 16:50:42,597 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-21 16:50:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:42,597 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-21 16:50:42,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-21 16:50:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:42,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:42,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:42,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 16:50:42,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:42,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-21 16:50:42,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:42,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962388001] [2022-07-21 16:50:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:42,658 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:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962388001] [2022-07-21 16:50:42,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962388001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:42,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:42,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:50:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979020512] [2022-07-21 16:50:42,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:42,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:50:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:50:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:50:42,665 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:42,688 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-21 16:50:42,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:50:42,688 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:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:42,689 INFO L225 Difference]: With dead ends: 25 [2022-07-21 16:50:42,689 INFO L226 Difference]: Without dead ends: 25 [2022-07-21 16:50:42,689 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:42,693 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:42,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-21 16:50:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-21 16:50:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-21 16:50:42,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-07-21 16:50:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:42,701 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-21 16:50:42,701 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:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-21 16:50:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:42,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:42,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:42,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 16:50:42,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:42,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2022-07-21 16:50:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:42,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514151019] [2022-07-21 16:50:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:42,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:42,773 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:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:42,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514151019] [2022-07-21 16:50:42,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514151019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:42,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:42,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:50:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063636506] [2022-07-21 16:50:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:42,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:42,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:42,776 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:42,807 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-21 16:50:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:42,807 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:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:42,809 INFO L225 Difference]: With dead ends: 24 [2022-07-21 16:50:42,809 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 16:50:42,809 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:42,816 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:42,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 16:50:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-21 16:50:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-21 16:50:42,821 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2022-07-21 16:50:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:42,821 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-21 16:50:42,821 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:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-21 16:50:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:42,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:42,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:42,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 16:50:42,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:42,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-21 16:50:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:42,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429321946] [2022-07-21 16:50:42,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:42,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:42,875 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:42,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:42,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429321946] [2022-07-21 16:50:42,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429321946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:42,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:42,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:50:42,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604723947] [2022-07-21 16:50:42,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:42,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:42,878 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:42,890 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-21 16:50:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:42,891 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:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:42,891 INFO L225 Difference]: With dead ends: 40 [2022-07-21 16:50:42,891 INFO L226 Difference]: Without dead ends: 40 [2022-07-21 16:50:42,892 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:42,892 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:42,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-21 16:50:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2022-07-21 16:50:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-21 16:50:42,895 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-21 16:50:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:42,895 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-21 16:50:42,896 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:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-21 16:50:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:50:42,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:42,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:42,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 16:50:42,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2022-07-21 16:50:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130465901] [2022-07-21 16:50:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:42,928 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:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130465901] [2022-07-21 16:50:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130465901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:42,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:50:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108098844] [2022-07-21 16:50:42,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:42,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:42,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:42,931 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:42,963 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-21 16:50:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:42,963 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:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:42,964 INFO L225 Difference]: With dead ends: 44 [2022-07-21 16:50:42,964 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 16:50:42,964 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:42,965 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:42,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 16:50:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-21 16:50:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 16:50:42,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2022-07-21 16:50:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:42,968 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 16:50:42,968 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:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 16:50:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:50:42,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:42,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:42,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 16:50:42,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 748014037, now seen corresponding path program 1 times [2022-07-21 16:50:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:42,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889846534] [2022-07-21 16:50:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:43,029 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:43,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:43,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889846534] [2022-07-21 16:50:43,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889846534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:43,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:43,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:50:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503412752] [2022-07-21 16:50:43,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:43,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:50:43,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:50:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:50:43,032 INFO L87 Difference]: Start difference. First operand 28 states and 32 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:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:43,087 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-07-21 16:50:43,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:50:43,087 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:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:43,088 INFO L225 Difference]: With dead ends: 35 [2022-07-21 16:50:43,088 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 16:50:43,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:50:43,089 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:43,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 16:50:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-07-21 16:50:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) 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:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-21 16:50:43,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2022-07-21 16:50:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:43,095 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-21 16:50:43,095 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:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-21 16:50:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 16:50:43,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:43,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:43,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 16:50:43,096 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash 748014036, now seen corresponding path program 1 times [2022-07-21 16:50:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:43,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026374615] [2022-07-21 16:50:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:43,122 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:43,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:43,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026374615] [2022-07-21 16:50:43,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026374615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:43,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:43,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:50:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137344077] [2022-07-21 16:50:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:43,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:50:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:50:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:50:43,124 INFO L87 Difference]: Start difference. First operand 30 states and 35 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:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:43,152 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-07-21 16:50:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:50:43,153 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:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:43,153 INFO L225 Difference]: With dead ends: 29 [2022-07-21 16:50:43,153 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 16:50:43,153 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:43,154 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:43,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 16:50:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-21 16:50:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-21 16:50:43,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2022-07-21 16:50:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:43,156 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-21 16:50:43,156 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:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-21 16:50:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:50:43,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:43,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:43,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 16:50:43,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598655, now seen corresponding path program 1 times [2022-07-21 16:50:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:43,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736421643] [2022-07-21 16:50:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:43,220 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:43,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:43,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736421643] [2022-07-21 16:50:43,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736421643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:43,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:43,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:50:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353011393] [2022-07-21 16:50:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:43,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:50:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:43,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:50:43,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:50:43,222 INFO L87 Difference]: Start difference. First operand 29 states and 33 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:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:43,249 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-07-21 16:50:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:50:43,249 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:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:43,249 INFO L225 Difference]: With dead ends: 28 [2022-07-21 16:50:43,250 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 16:50:43,250 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:43,250 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:43,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 16:50:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-21 16:50:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 16:50:43,252 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2022-07-21 16:50:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:43,253 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 16:50:43,253 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:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 16:50:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:50:43,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:43,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:43,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 16:50:43,254 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598656, now seen corresponding path program 1 times [2022-07-21 16:50:43,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:43,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858018056] [2022-07-21 16:50:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:43,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:43,297 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:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:43,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858018056] [2022-07-21 16:50:43,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858018056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:43,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:43,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:50:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995391906] [2022-07-21 16:50:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:43,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:50:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:50:43,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:50:43,299 INFO L87 Difference]: Start difference. First operand 28 states and 32 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:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:43,348 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-21 16:50:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:50:43,348 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:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:43,349 INFO L225 Difference]: With dead ends: 30 [2022-07-21 16:50:43,349 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 16:50:43,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:50:43,350 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:43,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 16:50:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-21 16:50:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-21 16:50:43,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-07-21 16:50:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:43,352 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-21 16:50:43,352 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:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-21 16:50:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:50:43,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:43,353 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:43,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 16:50:43,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:43,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2022-07-21 16:50:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:43,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132548172] [2022-07-21 16:50:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 16:50:43,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:43,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132548172] [2022-07-21 16:50:43,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132548172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:43,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:43,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:50:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526342248] [2022-07-21 16:50:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:43,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:43,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:43,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:43,378 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:43,396 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-21 16:50:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:43,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 16:50:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:43,397 INFO L225 Difference]: With dead ends: 49 [2022-07-21 16:50:43,397 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 16:50:43,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:50:43,397 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:43,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 16:50:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2022-07-21 16:50:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) 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:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-21 16:50:43,400 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2022-07-21 16:50:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:43,400 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-21 16:50:43,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-21 16:50:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:50:43,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:43,401 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:43,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 16:50:43,401 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-21 16:50:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:43,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585029308] [2022-07-21 16:50:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:43,445 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:43,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585029308] [2022-07-21 16:50:43,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585029308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203006750] [2022-07-21 16:50:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:43,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:43,452 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:43,491 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:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:43,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 16:50:43,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:43,603 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:50:43,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 16:50:43,661 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:43,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:43,763 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:43,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203006750] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:43,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:43,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-21 16:50:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353875272] [2022-07-21 16:50:43,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:43,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 16:50:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:43,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 16:50:43,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:50:43,765 INFO L87 Difference]: Start difference. First operand 30 states and 35 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:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:43,859 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-21 16:50:43,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:50:43,859 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:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:43,860 INFO L225 Difference]: With dead ends: 62 [2022-07-21 16:50:43,860 INFO L226 Difference]: Without dead ends: 62 [2022-07-21 16:50:43,860 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:43,861 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:43,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-21 16:50:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 27. [2022-07-21 16:50:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-21 16:50:43,863 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2022-07-21 16:50:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:43,863 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-21 16:50:43,863 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:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-21 16:50:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:50:43,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:43,864 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:43,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 16:50:44,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 16:50:44,082 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash -163723683, now seen corresponding path program 1 times [2022-07-21 16:50:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173372510] [2022-07-21 16:50:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:44,144 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:44,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:44,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173372510] [2022-07-21 16:50:44,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173372510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:44,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:44,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:50:44,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730704963] [2022-07-21 16:50:44,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:44,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:50:44,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:44,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:50:44,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:50:44,153 INFO L87 Difference]: Start difference. First operand 27 states and 31 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:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:44,214 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-07-21 16:50:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:50:44,215 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:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:44,215 INFO L225 Difference]: With dead ends: 39 [2022-07-21 16:50:44,215 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 16:50:44,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:50:44,216 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:44,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 16:50:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-21 16:50:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 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:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-21 16:50:44,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2022-07-21 16:50:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:44,218 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-21 16:50:44,218 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:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-21 16:50:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:50:44,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:44,219 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 16:50:44,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 537340895, now seen corresponding path program 1 times [2022-07-21 16:50:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:44,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906589897] [2022-07-21 16:50:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:44,310 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:44,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:44,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906589897] [2022-07-21 16:50:44,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906589897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:44,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:44,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:50:44,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658035247] [2022-07-21 16:50:44,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:44,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:50:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:50:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:50:44,312 INFO L87 Difference]: Start difference. First operand 35 states and 39 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:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:44,417 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-07-21 16:50:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:50:44,417 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:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:44,418 INFO L225 Difference]: With dead ends: 53 [2022-07-21 16:50:44,418 INFO L226 Difference]: Without dead ends: 53 [2022-07-21 16:50:44,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-21 16:50:44,418 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:44,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-21 16:50:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-21 16:50:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-21 16:50:44,420 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2022-07-21 16:50:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:44,421 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-21 16:50:44,421 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:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-21 16:50:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 16:50:44,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:44,421 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:44,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 16:50:44,422 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash 795506333, now seen corresponding path program 1 times [2022-07-21 16:50:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:44,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470797798] [2022-07-21 16:50:44,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:44,514 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:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470797798] [2022-07-21 16:50:44,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470797798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:44,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:44,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 16:50:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218255893] [2022-07-21 16:50:44,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:44,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:50:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:50:44,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:50:44,517 INFO L87 Difference]: Start difference. First operand 33 states and 37 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:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:44,698 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-07-21 16:50:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 16:50:44,699 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:44,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:44,699 INFO L225 Difference]: With dead ends: 47 [2022-07-21 16:50:44,699 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 16:50:44,699 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:44,700 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:44,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 16:50:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-07-21 16:50:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 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:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-21 16:50:44,701 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2022-07-21 16:50:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:44,701 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-21 16:50:44,701 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:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-21 16:50:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 16:50:44,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:44,702 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:44,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 16:50:44,702 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:44,702 INFO L85 PathProgramCache]: Analyzing trace with hash -780511546, now seen corresponding path program 1 times [2022-07-21 16:50:44,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:44,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618035548] [2022-07-21 16:50:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:44,733 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:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:44,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618035548] [2022-07-21 16:50:44,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618035548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:50:44,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:50:44,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:50:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880287203] [2022-07-21 16:50:44,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:50:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:50:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:44,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:50:44,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:50:44,735 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:44,744 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-21 16:50:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:50:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:44,745 INFO L225 Difference]: With dead ends: 33 [2022-07-21 16:50:44,745 INFO L226 Difference]: Without dead ends: 21 [2022-07-21 16:50:44,745 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:44,746 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:44,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:50:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-21 16:50:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-21 16:50:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call 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:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-21 16:50:44,747 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-07-21 16:50:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:44,748 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-21 16:50:44,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-21 16:50:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:50:44,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:44,748 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:44,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 16:50:44,748 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2086958086, now seen corresponding path program 1 times [2022-07-21 16:50:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:44,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421154922] [2022-07-21 16:50:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:44,836 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:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:44,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421154922] [2022-07-21 16:50:44,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421154922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:44,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196596009] [2022-07-21 16:50:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:44,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:44,850 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:44,851 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:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:44,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 16:50:44,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:44,990 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:44,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:45,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 5 treesize of output 3 [2022-07-21 16:50:45,146 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:45,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196596009] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:45,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:45,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-07-21 16:50:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378656135] [2022-07-21 16:50:45,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:45,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 16:50:45,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 16:50:45,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-07-21 16:50:45,148 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 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:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:45,314 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-21 16:50:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:50:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 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:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:45,315 INFO L225 Difference]: With dead ends: 30 [2022-07-21 16:50:45,315 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 16:50:45,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2022-07-21 16:50:45,316 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:45,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 70 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 16:50:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-21 16:50:45,320 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:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-21 16:50:45,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-21 16:50:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:45,321 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-21 16:50:45,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 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:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-21 16:50:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 16:50:45,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:45,321 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:45,343 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:45,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 16:50:45,544 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash -271191237, now seen corresponding path program 1 times [2022-07-21 16:50:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:45,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863488790] [2022-07-21 16:50:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863488790] [2022-07-21 16:50:45,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863488790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976189866] [2022-07-21 16:50:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:45,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:45,663 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:45,664 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:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:45,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 16:50:45,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:45,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:50:45,764 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:45,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:50:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:45,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:46,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976189866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:46,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:46,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-07-21 16:50:46,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859564408] [2022-07-21 16:50:46,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:46,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 16:50:46,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 16:50:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-21 16:50:46,047 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:46,271 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-21 16:50:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:50:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:46,273 INFO L225 Difference]: With dead ends: 29 [2022-07-21 16:50:46,273 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 16:50:46,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-07-21 16:50:46,274 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:46,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 16:50:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-21 16:50:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call 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:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-21 16:50:46,277 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-07-21 16:50:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:46,277 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-21 16:50:46,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-21 16:50:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 16:50:46,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:46,278 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:46,296 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:46,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 16:50:46,496 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash -224662014, now seen corresponding path program 2 times [2022-07-21 16:50:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:46,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873028678] [2022-07-21 16:50:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:46,720 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:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:46,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873028678] [2022-07-21 16:50:46,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873028678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:46,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869270607] [2022-07-21 16:50:46,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:50:46,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:46,723 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:46,740 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:46,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:50:46,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:50:46,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 16:50:46,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:46,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:50:46,881 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:50:47,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:50:47,107 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:47,108 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:50:47,200 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:50:47,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:47,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:50:47,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0))) is different from false [2022-07-21 16:50:47,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:47,463 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:50:47,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:47,470 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:50:47,474 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:50:47,490 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:50:47,578 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:50:47,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869270607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:47,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:47,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-21 16:50:47,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12958638] [2022-07-21 16:50:47,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:47,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 16:50:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 16:50:47,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=950, Unknown=2, NotChecked=126, Total=1190 [2022-07-21 16:50:47,579 INFO L87 Difference]: Start difference. First operand 25 states and 26 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:50:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:48,103 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-07-21 16:50:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 16:50:48,104 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:50:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:48,104 INFO L225 Difference]: With dead ends: 48 [2022-07-21 16:50:48,104 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 16:50:48,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=1929, Unknown=2, NotChecked=182, Total=2352 [2022-07-21 16:50:48,105 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:48,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 141 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2022-07-21 16:50:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 16:50:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-21 16:50:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-21 16:50:48,107 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2022-07-21 16:50:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:48,107 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-21 16:50:48,107 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:50:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-21 16:50:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 16:50:48,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:48,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:48,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-21 16:50:48,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:48,309 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:48,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -121211530, now seen corresponding path program 2 times [2022-07-21 16:50:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:48,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476379592] [2022-07-21 16:50:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:48,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476379592] [2022-07-21 16:50:48,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476379592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:48,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307635143] [2022-07-21 16:50:48,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:50:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:48,520 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:48,521 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:50:48,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:50:48,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:50:48,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-21 16:50:48,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:48,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:50:48,603 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:48,611 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:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:48,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:48,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307635143] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:48,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:48,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-07-21 16:50:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702992796] [2022-07-21 16:50:49,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:49,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 16:50:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 16:50:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-07-21 16:50:49,002 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:49,366 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-21 16:50:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 16:50:49,366 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 16:50:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:49,367 INFO L225 Difference]: With dead ends: 34 [2022-07-21 16:50:49,367 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 16:50:49,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 16:50:49,368 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:49,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 100 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:50:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 16:50:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-21 16:50:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-21 16:50:49,369 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2022-07-21 16:50:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:49,369 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-21 16:50:49,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-21 16:50:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 16:50:49,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:49,370 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:50:49,391 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:50:49,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:49,579 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1054801383, now seen corresponding path program 3 times [2022-07-21 16:50:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:49,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775175344] [2022-07-21 16:50:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:49,796 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:50:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:49,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775175344] [2022-07-21 16:50:49,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775175344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:49,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917793481] [2022-07-21 16:50:49,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:50:49,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:49,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:49,799 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:50:49,800 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:50:49,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 16:50:49,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:50:49,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-21 16:50:49,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:49,893 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:50,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 16:50:50,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:50:50,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:50:50,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:50:50,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:50,440 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:50:50,453 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:50:50,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:50,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) is different from false [2022-07-21 16:50:50,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:50:50,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_260) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:50:50,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:50:50,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:50:50,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:50,507 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:50:50,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:50,512 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:50:50,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:50:50,703 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:50:50,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917793481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:50,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:50,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2022-07-21 16:50:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64868090] [2022-07-21 16:50:50,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:50,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-21 16:50:50,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:50,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-21 16:50:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1015, Unknown=5, NotChecked=340, Total=1482 [2022-07-21 16:50:50,705 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:51,026 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-21 16:50:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 16:50:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 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:50:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:51,027 INFO L225 Difference]: With dead ends: 54 [2022-07-21 16:50:51,027 INFO L226 Difference]: Without dead ends: 40 [2022-07-21 16:50:51,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1553, Unknown=5, NotChecked=420, Total=2162 [2022-07-21 16:50:51,029 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:51,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-07-21 16:50:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-21 16:50:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-07-21 16:50:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call 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,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-07-21 16:50:51,038 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2022-07-21 16:50:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:51,039 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-07-21 16:50:51,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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,039 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-07-21 16:50:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 16:50:51,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:51,040 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:50:51,073 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:50:51,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:51,247 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1308342596, now seen corresponding path program 4 times [2022-07-21 16:50:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:51,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811655081] [2022-07-21 16:50:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:51,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:51,422 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:50:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811655081] [2022-07-21 16:50:51,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811655081] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721882575] [2022-07-21 16:50:51,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:50:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:51,425 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:50:51,426 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:50:51,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:50:51,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:50:51,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-21 16:50:51,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:51,501 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:51,504 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:51,642 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:50:51,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:50:51,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 19 treesize of output 21 [2022-07-21 16:50:51,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:51,975 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 22 treesize of output 22 [2022-07-21 16:50:52,083 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:50:52,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:52,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0))) is different from false [2022-07-21 16:50:52,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|))) is different from false [2022-07-21 16:50:52,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:52,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:50:52,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:52,432 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:50:52,436 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:50:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 16:50:52,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721882575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:52,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:52,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2022-07-21 16:50:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394073844] [2022-07-21 16:50:52,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:52,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-21 16:50:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:52,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-21 16:50:52,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1456, Unknown=2, NotChecked=158, Total=1806 [2022-07-21 16:50:52,923 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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:50:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:53,495 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-21 16:50:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 16:50:53,498 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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:50:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:53,499 INFO L225 Difference]: With dead ends: 43 [2022-07-21 16:50:53,499 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 16:50:53,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=2595, Unknown=2, NotChecked=214, Total=3192 [2022-07-21 16:50:53,500 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:53,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 211 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2022-07-21 16:50:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 16:50:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-07-21 16:50:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-07-21 16:50:53,501 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2022-07-21 16:50:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:53,501 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-07-21 16:50:53,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 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:50:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-07-21 16:50:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 16:50:53,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:53,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:53,538 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:50:53,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:53,715 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1903914801, now seen corresponding path program 3 times [2022-07-21 16:50:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:53,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355568140] [2022-07-21 16:50:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:53,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355568140] [2022-07-21 16:50:53,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355568140] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:53,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35623252] [2022-07-21 16:50:53,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:50:53,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:53,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:53,911 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:50:53,912 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:50:54,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 16:50:54,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:50:54,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-21 16:50:54,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:54,076 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:50:54,076 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:54,086 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:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 16:50:54,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:50:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 16:50:54,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35623252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:50:54,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:50:54,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-07-21 16:50:54,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532646756] [2022-07-21 16:50:54,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:50:54,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 16:50:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:50:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 16:50:54,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2022-07-21 16:50:54,881 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:50:55,843 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-07-21 16:50:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 16:50:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-21 16:50:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:50:55,844 INFO L225 Difference]: With dead ends: 56 [2022-07-21 16:50:55,844 INFO L226 Difference]: Without dead ends: 56 [2022-07-21 16:50:55,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=437, Invalid=2113, Unknown=0, NotChecked=0, Total=2550 [2022-07-21 16:50:55,845 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:50:55,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 125 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 367 Invalid, 0 Unknown, 11 Unchecked, 0.2s Time] [2022-07-21 16:50:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-21 16:50:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2022-07-21 16:50:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-07-21 16:50:55,846 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 35 [2022-07-21 16:50:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:50:55,847 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-07-21 16:50:55,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:50:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-07-21 16:50:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 16:50:55,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:50:55,848 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:50:55,892 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:50:56,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-21 16:50:56,066 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:50:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:50:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash 187721292, now seen corresponding path program 5 times [2022-07-21 16:50:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:50:56,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579740415] [2022-07-21 16:50:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:50:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:50:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:50:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:56,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:50:56,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579740415] [2022-07-21 16:50:56,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579740415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:50:56,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447256333] [2022-07-21 16:50:56,419 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:50:56,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:50:56,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:50:56,421 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:50:56,422 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:50:56,521 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-21 16:50:56,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:50:56,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-21 16:50:56,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:50:56,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 16:50:56,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:50:56,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 16:50:57,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:50:57,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 16:50:57,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:50:57,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 16:50:57,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:50:57,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:50:57,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2022-07-21 16:50:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:50:57,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:51:55,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-21 16:51:57,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-21 16:51:57,726 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 776 treesize of output 764 [2022-07-21 16:51:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-21 16:51:59,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447256333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:51:59,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:51:59,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 49 [2022-07-21 16:51:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098136676] [2022-07-21 16:51:59,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:51:59,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-21 16:51:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:51:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-21 16:51:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1995, Unknown=27, NotChecked=182, Total=2352 [2022-07-21 16:51:59,318 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:01,719 WARN L833 $PredicateComparison]: unable to prove that (and (< 3 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~length2~0#1| 4) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (< 3 |ULTIMATE.start_main_~length2~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0))) (<= 0 |c_ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:03,734 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< 3 |ULTIMATE.start_main_~length2~0#1|))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) 3) 0) (<= |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) is different from false [2022-07-21 16:52:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:04,034 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-21 16:52:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 16:52:04,035 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-21 16:52:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:04,036 INFO L225 Difference]: With dead ends: 78 [2022-07-21 16:52:04,036 INFO L226 Difference]: Without dead ends: 60 [2022-07-21 16:52:04,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=257, Invalid=3390, Unknown=29, NotChecked=484, Total=4160 [2022-07-21 16:52:04,037 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:04,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 347 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 399 Invalid, 0 Unknown, 252 Unchecked, 0.2s Time] [2022-07-21 16:52:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-21 16:52:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-07-21 16:52:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-21 16:52:04,039 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 38 [2022-07-21 16:52:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:04,039 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-21 16:52:04,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-21 16:52:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 16:52:04,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:04,040 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:04,059 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:52:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-21 16:52:04,240 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 406746281, now seen corresponding path program 6 times [2022-07-21 16:52:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:04,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822223819] [2022-07-21 16:52:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:04,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822223819] [2022-07-21 16:52:04,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822223819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:04,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717994066] [2022-07-21 16:52:04,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:52:04,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:04,414 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:52:04,415 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:52:04,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-21 16:52:04,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:04,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 16:52:04,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:04,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:04,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-21 16:52:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717994066] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:04,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:04,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2022-07-21 16:52:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616549330] [2022-07-21 16:52:04,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:04,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 16:52:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 16:52:04,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 16:52:04,985 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 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:52:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:05,383 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-21 16:52:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 16:52:05,384 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 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 42 [2022-07-21 16:52:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:05,384 INFO L225 Difference]: With dead ends: 57 [2022-07-21 16:52:05,384 INFO L226 Difference]: Without dead ends: 57 [2022-07-21 16:52:05,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1633, Unknown=0, NotChecked=0, Total=2070 [2022-07-21 16:52:05,385 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:05,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 146 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:52:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-21 16:52:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-21 16:52:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-07-21 16:52:05,386 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 42 [2022-07-21 16:52:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:05,387 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-07-21 16:52:05,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 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:52:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-07-21 16:52:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 16:52:05,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:05,387 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:52:05,409 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:52:05,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-21 16:52:05,602 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 892135217, now seen corresponding path program 7 times [2022-07-21 16:52:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:05,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891146596] [2022-07-21 16:52:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:06,048 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:52:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:06,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891146596] [2022-07-21 16:52:06,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891146596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:06,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589406603] [2022-07-21 16:52:06,049 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:52:06,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:06,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:06,051 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:52:06,052 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:52:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:06,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-21 16:52:06,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:06,150 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:06,350 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:06,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:06,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:06,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:06,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:06,569 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:52:06,571 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:52:06,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:06,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:52:06,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:06,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:06,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:06,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_501) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:06,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:06,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:06,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:06,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_503) |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:52:06,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:06,617 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:06,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:06,621 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:06,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:06,772 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:52:06,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589406603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:06,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:06,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 48 [2022-07-21 16:52:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703038294] [2022-07-21 16:52:06,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:06,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-21 16:52:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-21 16:52:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1375, Unknown=9, NotChecked=738, Total=2256 [2022-07-21 16:52:06,774 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:07,341 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-21 16:52:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 16:52:07,342 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-21 16:52:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:07,342 INFO L225 Difference]: With dead ends: 86 [2022-07-21 16:52:07,342 INFO L226 Difference]: Without dead ends: 64 [2022-07-21 16:52:07,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=2087, Unknown=9, NotChecked=900, Total=3192 [2022-07-21 16:52:07,343 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:07,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 343 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 512 Invalid, 0 Unknown, 388 Unchecked, 0.2s Time] [2022-07-21 16:52:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-21 16:52:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-07-21 16:52:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 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:52:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-21 16:52:07,345 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 46 [2022-07-21 16:52:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:07,345 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-21 16:52:07,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-21 16:52:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 16:52:07,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:07,346 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:52:07,363 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:52:07,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-21 16:52:07,563 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash -282507122, now seen corresponding path program 8 times [2022-07-21 16:52:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:07,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95528605] [2022-07-21 16:52:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:07,771 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:52:07,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:07,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95528605] [2022-07-21 16:52:07,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95528605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:07,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18716774] [2022-07-21 16:52:07,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:52:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:07,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:07,781 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:52:07,782 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:52:07,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:52:07,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:07,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-21 16:52:07,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:08,041 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:52:08,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:08,241 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:08,266 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:52:08,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18716774] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:08,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-21 16:52:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231218349] [2022-07-21 16:52:08,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:08,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 16:52:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 16:52:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 16:52:08,269 INFO L87 Difference]: Start difference. First operand 61 states and 64 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:52:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:08,833 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-07-21 16:52:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 16:52:08,834 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:52:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:08,834 INFO L225 Difference]: With dead ends: 61 [2022-07-21 16:52:08,834 INFO L226 Difference]: Without dead ends: 61 [2022-07-21 16:52:08,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-21 16:52:08,837 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:08,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:52:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-21 16:52:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-21 16:52:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 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:52:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-07-21 16:52:08,838 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 50 [2022-07-21 16:52:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:08,838 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-07-21 16:52:08,838 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:52:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-07-21 16:52:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 16:52:08,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:08,839 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:52:08,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 16:52:09,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 16:52:09,052 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 823214230, now seen corresponding path program 9 times [2022-07-21 16:52:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:09,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058357178] [2022-07-21 16:52:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:09,643 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:52:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058357178] [2022-07-21 16:52:09,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058357178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49725197] [2022-07-21 16:52:09,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:52:09,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:09,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:09,645 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:52:09,646 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:52:09,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-21 16:52:09,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:09,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 153 conjunts are in the unsatisfiable core [2022-07-21 16:52:09,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:09,875 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:10,213 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:10,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:52:10,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:52:10,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:10,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:10,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:10,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:52:10,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:10,970 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:10,973 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:52:10,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:10,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:52:10,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:10,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_622) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:10,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_621) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,010 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_620) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_619) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:11,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:11,053 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:11,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:11,059 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:11,062 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:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2022-07-21 16:52:11,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49725197] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:11,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:11,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 69 [2022-07-21 16:52:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565028300] [2022-07-21 16:52:11,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:11,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-21 16:52:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-21 16:52:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3127, Unknown=11, NotChecked=1342, Total=4692 [2022-07-21 16:52:11,385 INFO L87 Difference]: Start difference. First operand 61 states and 63 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:52:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:12,322 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-07-21 16:52:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 16:52:12,322 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 54 [2022-07-21 16:52:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:12,323 INFO L225 Difference]: With dead ends: 94 [2022-07-21 16:52:12,323 INFO L226 Difference]: Without dead ends: 68 [2022-07-21 16:52:12,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 5 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=361, Invalid=5834, Unknown=11, NotChecked=1804, Total=8010 [2022-07-21 16:52:12,325 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:12,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 533 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 706 Invalid, 0 Unknown, 727 Unchecked, 0.2s Time] [2022-07-21 16:52:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-21 16:52:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-21 16:52:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-07-21 16:52:12,327 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2022-07-21 16:52:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:12,327 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-07-21 16:52:12,327 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:52:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-07-21 16:52:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 16:52:12,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:12,329 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:12,347 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:52:12,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 16:52:12,547 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash -101124877, now seen corresponding path program 10 times [2022-07-21 16:52:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:12,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670244647] [2022-07-21 16:52:12,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670244647] [2022-07-21 16:52:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670244647] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854654193] [2022-07-21 16:52:12,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:52:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:12,816 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:52:12,836 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:52:12,934 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:52:12,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:12,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-21 16:52:12,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:12,944 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:12,951 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:52:13,265 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:52:13,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:13,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:13,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:13,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:13,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:52:13,928 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:13,928 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:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:14,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:14,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:52:14,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (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_696) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0))) is different from false [2022-07-21 16:52:14,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:14,930 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:14,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:14,935 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:14,942 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:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-21 16:52:15,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854654193] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:15,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:15,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 66 [2022-07-21 16:52:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518850903] [2022-07-21 16:52:15,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:15,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-21 16:52:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-21 16:52:15,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3727, Unknown=5, NotChecked=254, Total=4422 [2022-07-21 16:52:15,821 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:17,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (or (not (= (+ (- 1) .cse0) (+ (- 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (or (and (<= 0 .cse1) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse0)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_696) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))) (<= .cse1 .cse0) (<= |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 6) (<= 6 .cse0) (<= 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) is different from false [2022-07-21 16:52:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:17,865 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-07-21 16:52:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 16:52:17,866 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-21 16:52:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:17,866 INFO L225 Difference]: With dead ends: 68 [2022-07-21 16:52:17,866 INFO L226 Difference]: Without dead ends: 68 [2022-07-21 16:52:17,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1337 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1134, Invalid=6680, Unknown=30, NotChecked=528, Total=8372 [2022-07-21 16:52:17,868 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 112 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:17,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 350 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 780 Invalid, 0 Unknown, 413 Unchecked, 0.4s Time] [2022-07-21 16:52:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-21 16:52:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-21 16:52:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-21 16:52:17,870 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2022-07-21 16:52:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:17,870 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-21 16:52:17,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-21 16:52:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 16:52:17,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:17,870 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:17,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 16:52:18,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:18,071 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2106334426, now seen corresponding path program 4 times [2022-07-21 16:52:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:18,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548531687] [2022-07-21 16:52:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:18,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:18,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548531687] [2022-07-21 16:52:18,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548531687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:18,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041029869] [2022-07-21 16:52:18,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:52:18,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:18,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:18,386 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:52:18,387 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:52:18,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:52:18,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:18,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 16:52:18,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:18,502 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:52:18,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 92 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:18,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 91 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:19,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041029869] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:19,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:19,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 47 [2022-07-21 16:52:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897788097] [2022-07-21 16:52:19,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:19,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-21 16:52:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:19,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-21 16:52:19,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 16:52:19,358 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:19,825 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-21 16:52:19,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 16:52:19,825 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-21 16:52:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:19,826 INFO L225 Difference]: With dead ends: 107 [2022-07-21 16:52:19,826 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 16:52:19,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=859, Invalid=3173, Unknown=0, NotChecked=0, Total=4032 [2022-07-21 16:52:19,827 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:19,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:52:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 16:52:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-21 16:52:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.042857142857143) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-21 16:52:19,829 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 63 [2022-07-21 16:52:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:19,830 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-21 16:52:19,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-21 16:52:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 16:52:19,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:19,830 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:19,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 16:52:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:20,047 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 717029661, now seen corresponding path program 5 times [2022-07-21 16:52:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:20,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513611360] [2022-07-21 16:52:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 45 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:20,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:20,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513611360] [2022-07-21 16:52:20,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513611360] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:20,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111448775] [2022-07-21 16:52:20,346 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:52:20,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:20,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:20,347 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:52:20,348 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:52:20,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-21 16:52:20,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:20,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-21 16:52:20,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:20,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:52:20,579 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:52:20,581 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,114 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:21,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:21,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111448775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:21,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:21,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2022-07-21 16:52:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860155939] [2022-07-21 16:52:21,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:21,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-21 16:52:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-21 16:52:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2022-07-21 16:52:21,798 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:22,322 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-07-21 16:52:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 16:52:22,322 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-21 16:52:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:22,323 INFO L225 Difference]: With dead ends: 74 [2022-07-21 16:52:22,323 INFO L226 Difference]: Without dead ends: 74 [2022-07-21 16:52:22,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=913, Invalid=4057, Unknown=0, NotChecked=0, Total=4970 [2022-07-21 16:52:22,324 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:22,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:52:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-21 16:52:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-07-21 16:52:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-07-21 16:52:22,331 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2022-07-21 16:52:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:22,332 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-07-21 16:52:22,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-07-21 16:52:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 16:52:22,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:22,332 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:22,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-21 16:52:22,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:22,550 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2136703776, now seen corresponding path program 11 times [2022-07-21 16:52:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:22,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157742221] [2022-07-21 16:52:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:23,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:23,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157742221] [2022-07-21 16:52:23,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157742221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:23,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920871144] [2022-07-21 16:52:23,211 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:52:23,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:23,213 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:52:23,214 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:52:23,646 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-21 16:52:23,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:23,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 145 conjunts are in the unsatisfiable core [2022-07-21 16:52:23,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:23,659 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:23,988 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:24,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:52:24,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:52:24,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,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 16 treesize of output 18 [2022-07-21 16:52:24,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:52:24,440 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:52:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:24,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:24,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:52:24,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_922) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_921) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_920) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_919 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_919) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_918) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_917 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_917) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:24,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:24,565 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,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:24,569 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,572 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:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 111 not checked. [2022-07-21 16:52:24,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920871144] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:24,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:24,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 72 [2022-07-21 16:52:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708968589] [2022-07-21 16:52:24,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:24,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-21 16:52:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-21 16:52:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3037, Unknown=15, NotChecked=1860, Total=5112 [2022-07-21 16:52:24,849 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call 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:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:26,328 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-07-21 16:52:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-21 16:52:26,329 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-07-21 16:52:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:26,330 INFO L225 Difference]: With dead ends: 114 [2022-07-21 16:52:26,330 INFO L226 Difference]: Without dead ends: 80 [2022-07-21 16:52:26,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 16 SemanticMatches, 86 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=299, Invalid=5002, Unknown=15, NotChecked=2340, Total=7656 [2022-07-21 16:52:26,332 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:26,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 678 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1305 Invalid, 0 Unknown, 1207 Unchecked, 0.5s Time] [2022-07-21 16:52:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-21 16:52:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-07-21 16:52:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.04) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-07-21 16:52:26,335 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2022-07-21 16:52:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:26,335 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-07-21 16:52:26,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call 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:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-07-21 16:52:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 16:52:26,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:26,336 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:26,357 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:52:26,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:26,555 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1499060029, now seen corresponding path program 12 times [2022-07-21 16:52:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:26,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574234906] [2022-07-21 16:52:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:26,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574234906] [2022-07-21 16:52:26,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574234906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:26,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105618331] [2022-07-21 16:52:26,919 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:52:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:26,944 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:52:27,015 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:52:27,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-21 16:52:27,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:27,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-21 16:52:27,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:27,625 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:52:27,625 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:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:28,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 120 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:29,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105618331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:29,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:29,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2022-07-21 16:52:29,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014612128] [2022-07-21 16:52:29,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:29,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-21 16:52:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-21 16:52:29,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3314, Unknown=0, NotChecked=0, Total=3782 [2022-07-21 16:52:29,280 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call 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:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:30,650 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-07-21 16:52:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 16:52:30,650 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 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:52:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:30,651 INFO L225 Difference]: With dead ends: 83 [2022-07-21 16:52:30,651 INFO L226 Difference]: Without dead ends: 83 [2022-07-21 16:52:30,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1560, Invalid=6272, Unknown=0, NotChecked=0, Total=7832 [2022-07-21 16:52:30,652 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 319 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:30,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 236 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:52:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-21 16:52:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-07-21 16:52:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-07-21 16:52:30,653 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2022-07-21 16:52:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:30,653 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-07-21 16:52:30,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call 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:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-07-21 16:52:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 16:52:30,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:30,654 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:30,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-21 16:52:30,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:30,860 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash -773779368, now seen corresponding path program 6 times [2022-07-21 16:52:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:30,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320112967] [2022-07-21 16:52:30,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:30,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 66 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320112967] [2022-07-21 16:52:31,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320112967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:31,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151402076] [2022-07-21 16:52:31,209 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:52:31,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:31,210 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:52:31,213 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:52:31,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-21 16:52:31,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:31,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-21 16:52:31,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:31,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:52:31,793 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:52:31,795 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:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:32,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:32,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151402076] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:32,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:32,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 62 [2022-07-21 16:52:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59122824] [2022-07-21 16:52:32,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:32,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-21 16:52:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-21 16:52:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3426, Unknown=0, NotChecked=0, Total=3906 [2022-07-21 16:52:32,962 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call 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:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:34,259 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-07-21 16:52:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 16:52:34,259 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 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 75 [2022-07-21 16:52:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:34,260 INFO L225 Difference]: With dead ends: 82 [2022-07-21 16:52:34,260 INFO L226 Difference]: Without dead ends: 82 [2022-07-21 16:52:34,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1573, Invalid=6437, Unknown=0, NotChecked=0, Total=8010 [2022-07-21 16:52:34,261 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 415 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:34,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 214 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:52:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-21 16:52:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-07-21 16:52:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call 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:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-07-21 16:52:34,262 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2022-07-21 16:52:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:34,262 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-07-21 16:52:34,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call 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:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-07-21 16:52:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 16:52:34,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:34,263 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:52:34,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-21 16:52:34,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:34,463 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash -571678779, now seen corresponding path program 13 times [2022-07-21 16:52:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40688830] [2022-07-21 16:52:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:34,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:35,435 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:52:35,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:35,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40688830] [2022-07-21 16:52:35,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40688830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:35,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040032487] [2022-07-21 16:52:35,436 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:52:35,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:35,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:35,438 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:35,439 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:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:35,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-21 16:52:35,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:35,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:52:35,913 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,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:36,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 16 treesize of output 18 [2022-07-21 16:52:36,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:52:36,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:36,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:36,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:36,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 14 treesize of output 16 [2022-07-21 16:52:36,435 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:52:36,437 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:52:36,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:36,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:52:36,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1175) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1174) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1173) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1172) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1171) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1170) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:36,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1177) |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:52:36,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:36,525 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:36,531 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:36,531 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:36,533 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:36,950 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:52:36,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040032487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:36,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:36,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 82 [2022-07-21 16:52:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137139897] [2022-07-21 16:52:36,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:36,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-21 16:52:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-21 16:52:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3981, Unknown=17, NotChecked=2414, Total=6642 [2022-07-21 16:52:36,952 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call 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:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:38,539 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2022-07-21 16:52:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-21 16:52:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 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:52:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:38,540 INFO L225 Difference]: With dead ends: 126 [2022-07-21 16:52:38,540 INFO L226 Difference]: Without dead ends: 88 [2022-07-21 16:52:38,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 106 SyntacticMatches, 25 SemanticMatches, 100 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=354, Invalid=6837, Unknown=17, NotChecked=3094, Total=10302 [2022-07-21 16:52:38,543 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1415 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:38,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 803 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1590 Invalid, 0 Unknown, 1415 Unchecked, 0.5s Time] [2022-07-21 16:52:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-21 16:52:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-21 16:52:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.036144578313253) internal successors, (86), 84 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-07-21 16:52:38,545 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 78 [2022-07-21 16:52:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:38,549 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-07-21 16:52:38,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call 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:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-07-21 16:52:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 16:52:38,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:38,561 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:52:38,579 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:38,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-21 16:52:38,771 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash 495226146, now seen corresponding path program 14 times [2022-07-21 16:52:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:38,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402390731] [2022-07-21 16:52:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:39,178 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:52:39,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:39,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402390731] [2022-07-21 16:52:39,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402390731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:39,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320408812] [2022-07-21 16:52:39,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:52:39,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:39,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:39,179 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:39,180 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:39,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:52:39,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:39,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-21 16:52:39,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:39,330 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:52:39,330 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:40,064 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:52:40,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 153 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:41,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320408812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:41,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:41,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2022-07-21 16:52:41,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496637672] [2022-07-21 16:52:41,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:41,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-21 16:52:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-21 16:52:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=4072, Unknown=0, NotChecked=0, Total=4556 [2022-07-21 16:52:41,106 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call 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:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:42,774 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-07-21 16:52:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 16:52:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 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:52:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:42,775 INFO L225 Difference]: With dead ends: 91 [2022-07-21 16:52:42,775 INFO L226 Difference]: Without dead ends: 91 [2022-07-21 16:52:42,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1706, Invalid=7800, Unknown=0, NotChecked=0, Total=9506 [2022-07-21 16:52:42,776 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 354 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:42,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 432 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 16:52:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-21 16:52:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-21 16:52:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:52:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-21 16:52:42,777 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 82 [2022-07-21 16:52:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:42,777 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-21 16:52:42,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call 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:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-21 16:52:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-21 16:52:42,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:42,778 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:42,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-21 16:52:42,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-21 16:52:42,986 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1827858669, now seen corresponding path program 7 times [2022-07-21 16:52:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:42,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428400767] [2022-07-21 16:52:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:42,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 91 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:43,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428400767] [2022-07-21 16:52:43,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428400767] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:43,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077683452] [2022-07-21 16:52:43,410 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:52:43,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:43,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:43,412 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:43,413 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:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:43,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-21 16:52:43,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:43,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:52:43,596 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:52:43,599 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:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 120 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:44,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:45,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077683452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:45,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:45,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-07-21 16:52:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146240214] [2022-07-21 16:52:45,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:45,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-21 16:52:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:45,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-21 16:52:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=4196, Unknown=0, NotChecked=0, Total=4692 [2022-07-21 16:52:45,116 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call 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:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:46,389 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-07-21 16:52:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 16:52:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 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 83 [2022-07-21 16:52:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:46,394 INFO L225 Difference]: With dead ends: 90 [2022-07-21 16:52:46,394 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 16:52:46,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1719, Invalid=7983, Unknown=0, NotChecked=0, Total=9702 [2022-07-21 16:52:46,395 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 568 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:46,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 378 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 16:52:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 16:52:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-07-21 16:52:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call 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:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-07-21 16:52:46,399 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2022-07-21 16:52:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:46,400 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-07-21 16:52:46,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call 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:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-07-21 16:52:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-21 16:52:46,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:46,400 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:52:46,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-21 16:52:46,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-21 16:52:46,618 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2142233814, now seen corresponding path program 15 times [2022-07-21 16:52:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:46,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085089607] [2022-07-21 16:52:46,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:47,679 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:52:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:47,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085089607] [2022-07-21 16:52:47,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085089607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:47,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003382997] [2022-07-21 16:52:47,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:52:47,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:47,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:47,682 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:47,684 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:48,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-21 16:52:48,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:48,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-21 16:52:48,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:48,721 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:49,193 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:49,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:49,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 16 treesize of output 18 [2022-07-21 16:52:49,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:49,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 16 treesize of output 18 [2022-07-21 16:52:49,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:52:50,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:52:50,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:50,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:50,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:50,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:52:50,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:50,510 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:50,513 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:52:50,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:50,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:52:50,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1455) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1454) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:52:50,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,554 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1453) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1452) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,570 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1451) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1450) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1457 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1449) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:52:50,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:50,635 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:50,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:50,640 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:50,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:52:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 179 not checked. [2022-07-21 16:52:51,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003382997] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:52:51,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:52:51,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 109 [2022-07-21 16:52:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414828734] [2022-07-21 16:52:51,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:52:51,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-07-21 16:52:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:52:51,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-07-21 16:52:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=7735, Unknown=19, NotChecked=3686, Total=11772 [2022-07-21 16:52:51,351 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:52:53,527 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2022-07-21 16:52:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-21 16:52:53,528 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 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:52:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:52:53,528 INFO L225 Difference]: With dead ends: 138 [2022-07-21 16:52:53,528 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 16:52:53,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 19 IntricatePredicates, 6 DeprecatedPredicates, 3987 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=533, Invalid=13566, Unknown=19, NotChecked=4788, Total=18906 [2022-07-21 16:52:53,530 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2070 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:52:53,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1357 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1470 Invalid, 0 Unknown, 2070 Unchecked, 0.5s Time] [2022-07-21 16:52:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 16:52:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-07-21 16:52:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.032967032967033) internal successors, (94), 92 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:52:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-07-21 16:52:53,531 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 86 [2022-07-21 16:52:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:52:53,532 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-07-21 16:52:53,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-07-21 16:52:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-21 16:52:53,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:52:53,532 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:52:53,559 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:53,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:53,747 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:52:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:52:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1422334855, now seen corresponding path program 16 times [2022-07-21 16:52:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:52:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962821917] [2022-07-21 16:52:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:52:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:52:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:52:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 120 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:52:54,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962821917] [2022-07-21 16:52:54,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962821917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:52:54,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376626216] [2022-07-21 16:52:54,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:52:54,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:52:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:52:54,202 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:54,203 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:52:54,359 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:52:54,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:52:54,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 174 conjunts are in the unsatisfiable core [2022-07-21 16:52:54,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:52:54,375 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:52:54,375 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:54,381 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:54,909 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:52:55,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:52:55,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:52:55,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:52:55,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:52:55,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:52:55,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 19 treesize of output 21 [2022-07-21 16:52:56,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:52:56,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 19 treesize of output 21 [2022-07-21 16:52:56,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 16:52:56,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:56,534 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 22 treesize of output 22 [2022-07-21 16:52:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:52:56,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:52:58,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0))) is different from false [2022-07-21 16:52:58,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|))) is different from false [2022-07-21 16:52:58,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:58,255 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:58,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:52:58,261 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:58,264 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:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-21 16:53:00,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376626216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:00,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:00,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37, 37] total 98 [2022-07-21 16:53:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046543041] [2022-07-21 16:53:00,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:00,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-21 16:53:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-21 16:53:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=884, Invalid=8426, Unknown=10, NotChecked=382, Total=9702 [2022-07-21 16:53:00,083 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call 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:03,166 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (= (+ |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (and (<= 0 .cse0) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1)) (forall ((v_ArrVal_1565 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (exists ((|ULTIMATE.start_main_~nondetString~0#1.offset| Int)) (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|))) (and (<= (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 10) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ (- 1) .cse2 |ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| (+ 9 |ULTIMATE.start_main_~nondetString~0#1.offset|))))) (<= .cse0 .cse1) (<= 9 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|))) is different from false [2022-07-21 16:53:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:03,503 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-07-21 16:53:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-21 16:53:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 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 90 [2022-07-21 16:53:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:03,505 INFO L225 Difference]: With dead ends: 101 [2022-07-21 16:53:03,505 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 16:53:03,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4121 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1893, Invalid=18098, Unknown=43, NotChecked=846, Total=20880 [2022-07-21 16:53:03,506 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 95 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:03,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 691 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 629 Invalid, 0 Unknown, 884 Unchecked, 0.3s Time] [2022-07-21 16:53:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 16:53:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2022-07-21 16:53:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 99 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:53:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-07-21 16:53:03,508 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 90 [2022-07-21 16:53:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:03,509 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-07-21 16:53:03,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call 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:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-07-21 16:53:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 16:53:03,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:03,510 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:03,535 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:03,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-21 16:53:03,731 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:03,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1142707534, now seen corresponding path program 8 times [2022-07-21 16:53:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:03,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827146338] [2022-07-21 16:53:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 120 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:04,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827146338] [2022-07-21 16:53:04,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827146338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:04,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950395323] [2022-07-21 16:53:04,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:53:04,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:04,257 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:04,258 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:04,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:53:04,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:04,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-21 16:53:04,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:04,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:53:04,467 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:04,470 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,345 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 153 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:05,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:06,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950395323] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:06,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:06,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 74 [2022-07-21 16:53:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032192229] [2022-07-21 16:53:06,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:06,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-21 16:53:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:06,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-21 16:53:06,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2022-07-21 16:53:06,467 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call 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:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:07,907 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-21 16:53:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 16:53:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-07-21 16:53:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:07,908 INFO L225 Difference]: With dead ends: 100 [2022-07-21 16:53:07,908 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 16:53:07,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2047, Invalid=9509, Unknown=0, NotChecked=0, Total=11556 [2022-07-21 16:53:07,910 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 401 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:07,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 571 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 16:53:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 16:53:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-21 16:53:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.030612244897959) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-07-21 16:53:07,912 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2022-07-21 16:53:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:07,912 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-07-21 16:53:07,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call 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:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-07-21 16:53:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 16:53:07,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:07,913 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:07,933 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:08,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-21 16:53:08,131 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2009926970, now seen corresponding path program 9 times [2022-07-21 16:53:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:08,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225057271] [2022-07-21 16:53:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 221 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:08,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225057271] [2022-07-21 16:53:08,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225057271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:08,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411018503] [2022-07-21 16:53:08,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:53:08,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:08,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:08,563 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:08,565 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:09,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-21 16:53:09,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:09,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-21 16:53:09,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:09,711 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:53:09,712 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:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:10,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:11,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411018503] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:11,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:11,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 67 [2022-07-21 16:53:11,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320243408] [2022-07-21 16:53:11,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:11,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-21 16:53:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:11,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-21 16:53:11,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=3663, Unknown=0, NotChecked=0, Total=4422 [2022-07-21 16:53:11,338 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call 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:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:11,910 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-07-21 16:53:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 16:53:11,911 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 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 95 [2022-07-21 16:53:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:11,912 INFO L225 Difference]: With dead ends: 155 [2022-07-21 16:53:11,912 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 16:53:11,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1313, Invalid=5329, Unknown=0, NotChecked=0, Total=6642 [2022-07-21 16:53:11,913 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:11,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 182 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:53:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 16:53:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-21 16:53:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-07-21 16:53:11,921 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 95 [2022-07-21 16:53:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:11,921 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-07-21 16:53:11,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call 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:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-07-21 16:53:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-21 16:53:11,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:11,922 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:11,944 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:12,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-21 16:53:12,142 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2008413431, now seen corresponding path program 10 times [2022-07-21 16:53:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:12,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990902053] [2022-07-21 16:53:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 153 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:12,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990902053] [2022-07-21 16:53:12,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990902053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:12,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108100177] [2022-07-21 16:53:12,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:53:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:12,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:12,670 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:12,674 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:53:12,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:53:12,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:12,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-21 16:53:12,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:12,856 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:53:12,856 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:12,864 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:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-21 16:53:13,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-21 16:53:14,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108100177] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:14,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:14,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 18] total 62 [2022-07-21 16:53:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882976726] [2022-07-21 16:53:14,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:14,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-21 16:53:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-21 16:53:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3470, Unknown=0, NotChecked=0, Total=3906 [2022-07-21 16:53:14,976 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call 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:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:20,548 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-21 16:53:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-21 16:53:20,548 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 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 99 [2022-07-21 16:53:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:20,549 INFO L225 Difference]: With dead ends: 160 [2022-07-21 16:53:20,549 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 16:53:20,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3021, Invalid=14009, Unknown=0, NotChecked=0, Total=17030 [2022-07-21 16:53:20,552 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 404 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:20,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 665 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2158 Invalid, 0 Unknown, 2 Unchecked, 0.8s Time] [2022-07-21 16:53:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 16:53:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 149. [2022-07-21 16:53:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.0952380952380953) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:53:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-07-21 16:53:20,565 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 99 [2022-07-21 16:53:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:20,565 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-07-21 16:53:20,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call 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:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-07-21 16:53:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-21 16:53:20,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:20,566 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:20,587 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:53:20,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:20,788 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 544873332, now seen corresponding path program 17 times [2022-07-21 16:53:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:20,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170692220] [2022-07-21 16:53:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:22,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:22,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170692220] [2022-07-21 16:53:22,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170692220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:22,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928246681] [2022-07-21 16:53:22,283 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:53:22,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:22,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:22,284 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:53:22,285 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:53:23,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-07-21 16:53:23,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:23,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 205 conjunts are in the unsatisfiable core [2022-07-21 16:53:23,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:23,190 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:23,858 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:24,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:53:24,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:53:24,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:53:24,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:24,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:53:24,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 14 treesize of output 16 [2022-07-21 16:53:24,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 16:53:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:24,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:24,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:53:24,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1989) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:53:24,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1988) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1987) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1986) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1985) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1984) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1983) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1982) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1981) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1980) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:24,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:53:24,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:24,843 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:24,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:24,848 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:24,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:53:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 263 not checked. [2022-07-21 16:53:25,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928246681] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:25,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:25,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 42, 42] total 104 [2022-07-21 16:53:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808816647] [2022-07-21 16:53:25,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:25,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-07-21 16:53:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-07-21 16:53:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=6261, Unknown=23, NotChecked=4140, Total=10712 [2022-07-21 16:53:25,399 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call 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:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:28,214 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-07-21 16:53:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-21 16:53:28,215 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 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 102 [2022-07-21 16:53:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:28,216 INFO L225 Difference]: With dead ends: 206 [2022-07-21 16:53:28,216 INFO L226 Difference]: Without dead ends: 156 [2022-07-21 16:53:28,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 144 SyntacticMatches, 41 SemanticMatches, 125 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=427, Invalid=10354, Unknown=23, NotChecked=5198, Total=16002 [2022-07-21 16:53:28,217 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2062 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:28,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1289 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2639 Invalid, 0 Unknown, 2062 Unchecked, 0.8s Time] [2022-07-21 16:53:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-21 16:53:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2022-07-21 16:53:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.0927152317880795) internal successors, (165), 152 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:53:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2022-07-21 16:53:28,219 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 102 [2022-07-21 16:53:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:28,219 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2022-07-21 16:53:28,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call 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:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2022-07-21 16:53:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 16:53:28,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:28,220 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:53:28,241 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:53:28,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:28,437 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1957085649, now seen corresponding path program 18 times [2022-07-21 16:53:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:28,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782876383] [2022-07-21 16:53:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 190 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:28,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782876383] [2022-07-21 16:53:28,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782876383] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:28,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554410771] [2022-07-21 16:53:28,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:53:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:28,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:28,976 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:53:28,977 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:53:31,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-21 16:53:31,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:32,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-21 16:53:32,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:32,023 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:53:32,023 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:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 231 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:33,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 276 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:34,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554410771] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:34,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:34,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2022-07-21 16:53:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402301681] [2022-07-21 16:53:34,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:34,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-21 16:53:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-21 16:53:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=6476, Unknown=0, NotChecked=0, Total=7310 [2022-07-21 16:53:34,797 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call 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:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:37,335 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-21 16:53:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 16:53:37,335 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 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:53:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:37,336 INFO L225 Difference]: With dead ends: 153 [2022-07-21 16:53:37,336 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 16:53:37,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3022, Invalid=12478, Unknown=0, NotChecked=0, Total=15500 [2022-07-21 16:53:37,337 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 463 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:37,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 474 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 16:53:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 16:53:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-21 16:53:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.086092715231788) internal successors, (164), 152 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:53:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-21 16:53:37,339 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 106 [2022-07-21 16:53:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:37,339 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-21 16:53:37,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call 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:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-21 16:53:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 16:53:37,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:37,340 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:53:37,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-21 16:53:37,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:37,542 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1557815385, now seen corresponding path program 19 times [2022-07-21 16:53:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:37,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770036139] [2022-07-21 16:53:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:37,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:38,929 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:53:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:38,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770036139] [2022-07-21 16:53:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770036139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:38,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296254658] [2022-07-21 16:53:38,930 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:53:38,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:38,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:38,931 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:53:38,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-21 16:53:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:39,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 220 conjunts are in the unsatisfiable core [2022-07-21 16:53:39,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:39,148 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:39,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:53:39,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 17 treesize of output 19 [2022-07-21 16:53:40,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,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 16 treesize of output 18 [2022-07-21 16:53:40,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:53:40,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:53:40,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 16 treesize of output 18 [2022-07-21 16:53:40,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40,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 14 treesize of output 16 [2022-07-21 16:53:40,655 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:53:40,658 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:53:40,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:40,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:53:40,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2231) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:53:40,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2230 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2230) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2229) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:53:40,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2228) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2227) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2226) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2225) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2224) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2223) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2222) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2221) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:53:40,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2232) |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:53:40,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:40,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:53:40,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:53:40,795 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:40,797 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:41,461 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:53:41,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296254658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:41,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:41,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 112 [2022-07-21 16:53:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945628167] [2022-07-21 16:53:41,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:41,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-21 16:53:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:41,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-21 16:53:41,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7247, Unknown=25, NotChecked=4850, Total=12432 [2022-07-21 16:53:41,463 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call 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:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:44,842 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2022-07-21 16:53:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-21 16:53:44,846 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 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:53:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:44,847 INFO L225 Difference]: With dead ends: 214 [2022-07-21 16:53:44,847 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 16:53:44,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 154 SyntacticMatches, 39 SemanticMatches, 136 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3693 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=464, Invalid=12267, Unknown=25, NotChecked=6150, Total=18906 [2022-07-21 16:53:44,848 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 6839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2670 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:44,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1607 Invalid, 6839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4114 Invalid, 0 Unknown, 2670 Unchecked, 1.3s Time] [2022-07-21 16:53:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 16:53:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-07-21 16:53:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0838709677419356) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call 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:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-07-21 16:53:44,850 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 110 [2022-07-21 16:53:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:44,851 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-07-21 16:53:44,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call 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:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-07-21 16:53:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 16:53:44,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:44,851 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:53:44,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-21 16:53:45,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-21 16:53:45,069 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:45,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 31283638, now seen corresponding path program 20 times [2022-07-21 16:53:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:45,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469633873] [2022-07-21 16:53:45,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:45,642 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:53:45,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:45,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469633873] [2022-07-21 16:53:45,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469633873] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:45,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037974340] [2022-07-21 16:53:45,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:53:45,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:45,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:45,644 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:53:45,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-21 16:53:45,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:53:45,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:45,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-21 16:53:45,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:45,927 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:53:45,927 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:47,100 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:53:47,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:53:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 325 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:53:48,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037974340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:53:48,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:53:48,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 92 [2022-07-21 16:53:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806599643] [2022-07-21 16:53:48,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:53:48,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-07-21 16:53:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:53:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-07-21 16:53:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=970, Invalid=7586, Unknown=0, NotChecked=0, Total=8556 [2022-07-21 16:53:48,697 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 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:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:53:50,043 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-07-21 16:53:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 16:53:50,052 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 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 114 [2022-07-21 16:53:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:53:50,053 INFO L225 Difference]: With dead ends: 157 [2022-07-21 16:53:50,053 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 16:53:50,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4180 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2618, Invalid=12388, Unknown=0, NotChecked=0, Total=15006 [2022-07-21 16:53:50,055 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 243 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:53:50,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 668 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 16:53:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 16:53:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-21 16:53:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 156 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call 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:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2022-07-21 16:53:50,057 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 114 [2022-07-21 16:53:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:53:50,057 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2022-07-21 16:53:50,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 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:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2022-07-21 16:53:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 16:53:50,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:53:50,058 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:53:50,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-21 16:53:50,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:50,271 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:53:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:53:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1148682818, now seen corresponding path program 21 times [2022-07-21 16:53:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:53:50,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818021400] [2022-07-21 16:53:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:53:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:53:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:53:52,051 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:53:52,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:53:52,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818021400] [2022-07-21 16:53:52,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818021400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:53:52,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545581528] [2022-07-21 16:53:52,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:53:52,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:53:52,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:53:52,053 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:53:52,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-21 16:53:58,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-21 16:53:58,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:53:58,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 307 conjunts are in the unsatisfiable core [2022-07-21 16:53:58,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:53:58,065 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:59,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:59,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:59,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:53:59,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:59,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:00,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:54:00,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:00,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:01,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:01,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:54:01,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:01,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:01,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:54:01,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:01,754 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:54:01,757 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:54:01,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:54:01,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:54:01,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2490) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2489) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2488) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2487) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2486) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2485 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2485) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2484 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2484) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2483 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2483) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2482) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2481 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2481) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2480 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2480) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:54:01,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:01,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:54:01,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:01,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:54:01,904 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:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 363 not checked. [2022-07-21 16:54:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545581528] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:54:03,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:54:03,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 149 [2022-07-21 16:54:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395227828] [2022-07-21 16:54:03,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:54:03,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2022-07-21 16:54:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:54:03,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2022-07-21 16:54:03,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=14391, Unknown=27, NotChecked=7182, Total=22052 [2022-07-21 16:54:03,109 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call 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:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:54:06,900 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2022-07-21 16:54:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-21 16:54:06,901 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 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:54:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:54:06,901 INFO L225 Difference]: With dead ends: 222 [2022-07-21 16:54:06,902 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 16:54:06,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 148 SyntacticMatches, 13 SemanticMatches, 187 ConstructedPredicates, 27 IntricatePredicates, 13 DeprecatedPredicates, 7961 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=736, Invalid=25427, Unknown=27, NotChecked=9342, Total=35532 [2022-07-21 16:54:06,906 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2591 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:54:06,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2094 Invalid, 4943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2335 Invalid, 0 Unknown, 2591 Unchecked, 0.7s Time] [2022-07-21 16:54:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 16:54:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2022-07-21 16:54:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0754716981132075) internal successors, (171), 160 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:54:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2022-07-21 16:54:06,908 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 118 [2022-07-21 16:54:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:54:06,909 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2022-07-21 16:54:06,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call 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:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2022-07-21 16:54:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 16:54:06,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:54:06,909 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:54:06,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-21 16:54:07,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:07,117 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:54:07,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:54:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1419851237, now seen corresponding path program 22 times [2022-07-21 16:54:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:54:07,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261909957] [2022-07-21 16:54:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:54:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:54:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:54:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 276 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:54:07,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261909957] [2022-07-21 16:54:07,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261909957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:54:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814282689] [2022-07-21 16:54:07,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:54:07,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:54:07,705 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:54:07,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-21 16:54:07,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:54:07,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:54:07,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 232 conjunts are in the unsatisfiable core [2022-07-21 16:54:07,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:54:07,950 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:07,953 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:54:08,673 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:54:08,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:54:08,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:54:09,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:54:09,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:09,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:09,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:09,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:09,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:54:09,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:09,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:09,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:54:09,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 16:54:10,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:54:10,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:10,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 21 treesize of output 21 [2022-07-21 16:54:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 338 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:10,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:54:13,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-21 16:54:13,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (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_2635) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-21 16:54:13,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:13,182 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:13,188 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:54:13,188 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:13,191 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:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 378 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-21 16:54:15,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814282689] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:54:15,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:54:15,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 49, 49] total 129 [2022-07-21 16:54:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296906846] [2022-07-21 16:54:15,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:54:15,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-07-21 16:54:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:54:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-07-21 16:54:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1503, Invalid=14748, Unknown=13, NotChecked=506, Total=16770 [2022-07-21 16:54:15,468 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call 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:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:54:20,576 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2022-07-21 16:54:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-21 16:54:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 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 122 [2022-07-21 16:54:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:54:20,577 INFO L225 Difference]: With dead ends: 161 [2022-07-21 16:54:20,578 INFO L226 Difference]: Without dead ends: 161 [2022-07-21 16:54:20,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 178 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5748 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=4518, Invalid=26907, Unknown=89, NotChecked=706, Total=32220 [2022-07-21 16:54:20,579 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 373 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 3767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1220 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:54:20,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1062 Invalid, 3767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 2195 Invalid, 0 Unknown, 1220 Unchecked, 0.8s Time] [2022-07-21 16:54:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-21 16:54:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-21 16:54:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0628930817610063) internal successors, (169), 160 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:54:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2022-07-21 16:54:20,594 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 122 [2022-07-21 16:54:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:54:20,595 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2022-07-21 16:54:20,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call 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:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2022-07-21 16:54:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-21 16:54:20,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:54:20,596 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:54:20,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-07-21 16:54:20,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-21 16:54:20,814 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:54:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:54:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1417438933, now seen corresponding path program 23 times [2022-07-21 16:54:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:54:20,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958386091] [2022-07-21 16:54:20,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:54:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:54:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:54:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 468 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:21,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:54:21,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958386091] [2022-07-21 16:54:21,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958386091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:54:21,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235034268] [2022-07-21 16:54:21,474 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:54:21,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:21,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:54:21,475 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:54:21,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-21 16:54:35,855 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-07-21 16:54:35,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:54:35,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 125 conjunts are in the unsatisfiable core [2022-07-21 16:54:35,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:54:35,905 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:54:35,905 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:54:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:36,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:54:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:38,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235034268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:54:38,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:54:38,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 86 [2022-07-21 16:54:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564744879] [2022-07-21 16:54:38,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:54:38,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-21 16:54:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:54:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-21 16:54:38,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1168, Invalid=6142, Unknown=0, NotChecked=0, Total=7310 [2022-07-21 16:54:38,005 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call 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:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:54:39,355 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2022-07-21 16:54:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-21 16:54:39,356 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 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:54:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:54:39,356 INFO L225 Difference]: With dead ends: 232 [2022-07-21 16:54:39,356 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 16:54:39,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2504, Invalid=11538, Unknown=0, NotChecked=0, Total=14042 [2022-07-21 16:54:39,358 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 151 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:54:39,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 279 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 16:54:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 16:54:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2022-07-21 16:54:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.0613496932515338) internal successors, (173), 164 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:54:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2022-07-21 16:54:39,360 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 130 [2022-07-21 16:54:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:54:39,360 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2022-07-21 16:54:39,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call 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:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2022-07-21 16:54:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 16:54:39,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:54:39,361 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:54:39,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-21 16:54:39,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-21 16:54:39,563 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:54:39,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:54:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash 367084040, now seen corresponding path program 24 times [2022-07-21 16:54:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:54:39,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162587006] [2022-07-21 16:54:39,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:54:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:54:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:54:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:54:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:54:41,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162587006] [2022-07-21 16:54:41,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162587006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:54:41,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630965267] [2022-07-21 16:54:41,759 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:54:41,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:54:41,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:54:41,760 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:54:41,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-21 16:54:59,448 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-07-21 16:54:59,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:54:59,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 301 conjunts are in the unsatisfiable core [2022-07-21 16:54:59,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:54:59,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:55:00,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 16:55:01,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 16 treesize of output 18 [2022-07-21 16:55:01,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:01,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:01,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:01,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:01,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:02,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:02,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:02,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:02,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 16 treesize of output 18 [2022-07-21 16:55:03,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:03,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:03,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:03,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:55:03,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:55:03,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:03,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-21 16:55:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:03,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:03,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-21 16:55:03,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2927) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2926) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2925) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2924 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2924) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2923) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2922) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:55:03,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2921 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2921) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2919) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2918) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2917) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2916) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2915 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-21 16:55:03,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2914) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:55:03,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:03,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:55:03,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:55:03,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:55:03,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 11 treesize of output 7 [2022-07-21 16:55:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 479 not checked. [2022-07-21 16:55:05,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630965267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:05,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:05,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 54, 54] total 169 [2022-07-21 16:55:05,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553855768] [2022-07-21 16:55:05,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:05,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 169 states [2022-07-21 16:55:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:05,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2022-07-21 16:55:05,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=18487, Unknown=31, NotChecked=9362, Total=28392 [2022-07-21 16:55:05,427 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand has 169 states, 169 states have (on average 2.2662721893491122) internal successors, (383), 169 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:55:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:09,714 INFO L93 Difference]: Finished difference Result 238 states and 246 transitions. [2022-07-21 16:55:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-07-21 16:55:09,715 INFO L78 Accepts]: Start accepts. Automaton has has 169 states, 169 states have (on average 2.2662721893491122) internal successors, (383), 169 states have internal predecessors, (383), 0 states have call successors, (0), 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 134 [2022-07-21 16:55:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:09,722 INFO L225 Difference]: With dead ends: 238 [2022-07-21 16:55:09,722 INFO L226 Difference]: Without dead ends: 172 [2022-07-21 16:55:09,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 168 SyntacticMatches, 26 SemanticMatches, 202 ConstructedPredicates, 31 IntricatePredicates, 4 DeprecatedPredicates, 10133 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=751, Invalid=29098, Unknown=31, NotChecked=11532, Total=41412 [2022-07-21 16:55:09,725 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 5777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3014 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:09,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 2244 Invalid, 5777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2744 Invalid, 0 Unknown, 3014 Unchecked, 0.8s Time] [2022-07-21 16:55:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-21 16:55:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2022-07-21 16:55:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.0598802395209581) internal successors, (177), 168 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:55:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 177 transitions. [2022-07-21 16:55:09,740 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 177 transitions. Word has length 134 [2022-07-21 16:55:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:09,741 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 177 transitions. [2022-07-21 16:55:09,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 169 states, 169 states have (on average 2.2662721893491122) internal successors, (383), 169 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:55:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 177 transitions. [2022-07-21 16:55:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 16:55:09,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:09,742 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:55:09,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:09,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-21 16:55:09,952 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1431647333, now seen corresponding path program 25 times [2022-07-21 16:55:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544601816] [2022-07-21 16:55:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 378 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:10,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544601816] [2022-07-21 16:55:10,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544601816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:10,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446816766] [2022-07-21 16:55:10,648 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:55:10,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:10,650 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:10,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-21 16:55:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:10,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-21 16:55:10,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 435 proven. 573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:11,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:55:12,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:55:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 435 proven. 573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:55:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446816766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:55:12,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:55:12,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 77 [2022-07-21 16:55:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705243171] [2022-07-21 16:55:12,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:55:12,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-21 16:55:12,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:55:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-21 16:55:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=5446, Unknown=0, NotChecked=0, Total=6006 [2022-07-21 16:55:12,634 INFO L87 Difference]: Start difference. First operand 169 states and 177 transitions. Second operand has 78 states, 77 states have (on average 3.5844155844155843) internal successors, (276), 78 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:55:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:55:15,528 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2022-07-21 16:55:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-21 16:55:15,529 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 3.5844155844155843) internal successors, (276), 78 states have internal predecessors, (276), 0 states have call successors, (0), 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:55:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:55:15,530 INFO L225 Difference]: With dead ends: 169 [2022-07-21 16:55:15,530 INFO L226 Difference]: Without dead ends: 169 [2022-07-21 16:55:15,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2338 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3237, Invalid=13275, Unknown=0, NotChecked=0, Total=16512 [2022-07-21 16:55:15,532 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 585 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:55:15,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 953 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 16:55:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-21 16:55:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-21 16:55:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.0538922155688624) internal successors, (176), 168 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:55:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2022-07-21 16:55:15,537 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 138 [2022-07-21 16:55:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:55:15,537 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2022-07-21 16:55:15,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 3.5844155844155843) internal successors, (276), 78 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:55:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2022-07-21 16:55:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-21 16:55:15,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:55:15,538 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:55:15,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-21 16:55:15,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:15,757 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-21 16:55:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:55:15,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2061145875, now seen corresponding path program 26 times [2022-07-21 16:55:15,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:55:15,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214405477] [2022-07-21 16:55:15,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:55:15,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:55:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:55:17,811 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:55:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:55:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214405477] [2022-07-21 16:55:17,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214405477] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:55:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349751334] [2022-07-21 16:55:17,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:55:17,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:55:17,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:55:17,813 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 16:55:17,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-21 16:55:18,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:55:18,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:55:18,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 267 conjunts are in the unsatisfiable core [2022-07-21 16:55:18,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:55:18,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:55:18,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:55:19,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:55:19,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:55:19,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:55:19,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:55:20,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19