./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-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 ab78f7d39533ea56445a9c400b78ef25527bc8ae ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab78f7d39533ea56445a9c400b78ef25527bc8ae ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 05:50:15,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:50:15,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:50:15,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:50:15,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:50:15,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:50:15,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:50:15,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:50:15,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:50:15,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:50:15,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:50:15,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:50:15,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:50:15,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:50:15,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:50:15,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:50:15,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:50:15,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:50:15,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:50:15,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:50:15,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:50:15,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:50:15,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:50:15,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:50:15,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:50:15,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:50:15,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:50:15,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:50:15,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:50:15,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:50:15,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:50:15,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:50:15,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:50:15,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:50:15,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:50:15,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:50:15,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:50:15,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:50:15,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:50:15,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:50:15,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:50:15,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-20 05:50:15,165 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:50:15,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:50:15,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:50:15,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:50:15,167 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:50:15,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:50:15,167 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:50:15,168 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:50:15,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:50:15,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:50:15,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:50:15,169 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:50:15,169 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:50:15,169 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:50:15,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:50:15,170 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:50:15,170 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:50:15,170 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:50:15,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:50:15,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:50:15,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:50:15,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:50:15,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:50:15,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:50:15,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:50:15,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 05:50:15,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 05:50:15,173 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:50:15,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> ab78f7d39533ea56445a9c400b78ef25527bc8ae [2020-10-20 05:50:15,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:50:15,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:50:15,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:50:15,384 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:50:15,384 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:50:15,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2020-10-20 05:50:15,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76095e340/b4868854dfb04a8c89c2cc3ac65781dd/FLAG010e86dc9 [2020-10-20 05:50:15,970 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:50:15,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2020-10-20 05:50:15,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76095e340/b4868854dfb04a8c89c2cc3ac65781dd/FLAG010e86dc9 [2020-10-20 05:50:16,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76095e340/b4868854dfb04a8c89c2cc3ac65781dd [2020-10-20 05:50:16,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:50:16,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:50:16,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:50:16,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:50:16,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:50:16,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7070cafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16, skipping insertion in model container [2020-10-20 05:50:16,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:50:16,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:50:16,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:50:16,818 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:50:16,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:50:16,924 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:50:16,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16 WrapperNode [2020-10-20 05:50:16,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:50:16,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:50:16,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:50:16,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:50:16,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... [2020-10-20 05:50:16,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:50:17,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:50:17,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:50:17,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:50:17,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:50:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:50:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:50:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:50:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:50:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:50:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:50:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:50:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2020-10-20 05:50:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:50:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:50:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:50:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:50:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:50:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:50:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:50:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:50:17,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:50:17,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:50:17,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:50:17,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:50:17,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:50:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:50:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:50:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:50:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:50:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:50:17,075 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:50:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:50:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:50:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:50:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:50:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:50:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:50:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:50:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:50:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:50:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:50:17,078 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:50:17,079 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:50:17,079 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:50:17,079 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:50:17,079 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:50:17,079 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:50:17,080 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:50:17,080 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:50:17,080 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:50:17,080 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:50:17,080 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:50:17,080 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:50:17,081 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:50:17,081 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:50:17,081 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:50:17,081 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:50:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:50:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:50:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:50:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:50:17,083 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:50:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:50:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:50:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:50:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:50:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:50:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:50:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:50:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:50:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:50:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:50:17,088 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:50:17,089 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:50:17,089 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:50:17,089 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:50:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:50:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:50:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:50:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:50:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:50:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 05:50:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-20 05:50:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlcpy [2020-10-20 05:50:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 05:50:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 05:50:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:50:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:50:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:50:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:50:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:50:17,643 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:50:17,643 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-20 05:50:17,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:50:17 BoogieIcfgContainer [2020-10-20 05:50:17,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:50:17,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:50:17,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:50:17,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:50:17,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:50:16" (1/3) ... [2020-10-20 05:50:17,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c69350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:50:17, skipping insertion in model container [2020-10-20 05:50:17,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:50:16" (2/3) ... [2020-10-20 05:50:17,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c69350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:50:17, skipping insertion in model container [2020-10-20 05:50:17,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:50:17" (3/3) ... [2020-10-20 05:50:17,654 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-1.i [2020-10-20 05:50:17,666 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:50:17,674 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2020-10-20 05:50:17,688 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2020-10-20 05:50:17,709 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:50:17,709 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:50:17,709 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:50:17,710 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:50:17,710 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:50:17,710 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:50:17,711 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:50:17,711 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:50:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-10-20 05:50:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:50:17,737 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:17,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:17,739 INFO L429 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:17,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1313588107, now seen corresponding path program 1 times [2020-10-20 05:50:17,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:17,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249996026] [2020-10-20 05:50:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:17,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:17,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249996026] [2020-10-20 05:50:17,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:17,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:50:17,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790873165] [2020-10-20 05:50:18,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:50:18,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:18,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:50:18,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:50:18,021 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2020-10-20 05:50:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:18,254 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2020-10-20 05:50:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:50:18,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 05:50:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:18,268 INFO L225 Difference]: With dead ends: 80 [2020-10-20 05:50:18,268 INFO L226 Difference]: Without dead ends: 76 [2020-10-20 05:50:18,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-20 05:50:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2020-10-20 05:50:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 05:50:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2020-10-20 05:50:18,315 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 11 [2020-10-20 05:50:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:18,316 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2020-10-20 05:50:18,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:50:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-10-20 05:50:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:50:18,317 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:18,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:18,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 05:50:18,318 INFO L429 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1311741065, now seen corresponding path program 1 times [2020-10-20 05:50:18,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:18,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583551461] [2020-10-20 05:50:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:18,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:18,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583551461] [2020-10-20 05:50:18,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:18,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 05:50:18,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741039357] [2020-10-20 05:50:18,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:50:18,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:50:18,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:50:18,420 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 4 states. [2020-10-20 05:50:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:18,551 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2020-10-20 05:50:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 05:50:18,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 05:50:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:18,554 INFO L225 Difference]: With dead ends: 57 [2020-10-20 05:50:18,554 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 05:50:18,555 INFO L677 BasicCegarLoop]: 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 [2020-10-20 05:50:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 05:50:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-20 05:50:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 05:50:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2020-10-20 05:50:18,563 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 11 [2020-10-20 05:50:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:18,563 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2020-10-20 05:50:18,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:50:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2020-10-20 05:50:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:50:18,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:18,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:18,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 05:50:18,565 INFO L429 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1311741064, now seen corresponding path program 1 times [2020-10-20 05:50:18,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:18,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116764860] [2020-10-20 05:50:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:18,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:18,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116764860] [2020-10-20 05:50:18,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:18,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 05:50:18,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923293694] [2020-10-20 05:50:18,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:50:18,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:18,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:50:18,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:50:18,660 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 5 states. [2020-10-20 05:50:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:18,857 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-10-20 05:50:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:50:18,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 05:50:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:18,859 INFO L225 Difference]: With dead ends: 77 [2020-10-20 05:50:18,859 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 05:50:18,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 05:50:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2020-10-20 05:50:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 05:50:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2020-10-20 05:50:18,877 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 11 [2020-10-20 05:50:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:18,877 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2020-10-20 05:50:18,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:50:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2020-10-20 05:50:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:50:18,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:18,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:18,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 05:50:18,879 INFO L429 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 362165772, now seen corresponding path program 1 times [2020-10-20 05:50:18,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:18,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741401647] [2020-10-20 05:50:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:18,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:18,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741401647] [2020-10-20 05:50:18,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:18,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 05:50:18,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805691951] [2020-10-20 05:50:18,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:50:18,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:50:18,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:50:18,939 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 4 states. [2020-10-20 05:50:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:19,043 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2020-10-20 05:50:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 05:50:19,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 05:50:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:19,045 INFO L225 Difference]: With dead ends: 57 [2020-10-20 05:50:19,045 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 05:50:19,046 INFO L677 BasicCegarLoop]: 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 [2020-10-20 05:50:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 05:50:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-20 05:50:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 05:50:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2020-10-20 05:50:19,052 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 13 [2020-10-20 05:50:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:19,052 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2020-10-20 05:50:19,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:50:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2020-10-20 05:50:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:50:19,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:19,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:19,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 05:50:19,053 INFO L429 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash 362165773, now seen corresponding path program 1 times [2020-10-20 05:50:19,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:19,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429962593] [2020-10-20 05:50:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:19,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429962593] [2020-10-20 05:50:19,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:19,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 05:50:19,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697139109] [2020-10-20 05:50:19,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:50:19,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:50:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:50:19,167 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 5 states. [2020-10-20 05:50:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:19,284 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-10-20 05:50:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:50:19,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 05:50:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:19,286 INFO L225 Difference]: With dead ends: 56 [2020-10-20 05:50:19,286 INFO L226 Difference]: Without dead ends: 56 [2020-10-20 05:50:19,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-20 05:50:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-20 05:50:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 05:50:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2020-10-20 05:50:19,292 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 13 [2020-10-20 05:50:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:19,292 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2020-10-20 05:50:19,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:50:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2020-10-20 05:50:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:50:19,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:19,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:19,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 05:50:19,293 INFO L429 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:19,294 INFO L82 PathProgramCache]: Analyzing trace with hash 362165826, now seen corresponding path program 1 times [2020-10-20 05:50:19,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:19,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773940795] [2020-10-20 05:50:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:19,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773940795] [2020-10-20 05:50:19,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:19,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:50:19,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820794239] [2020-10-20 05:50:19,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:50:19,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:50:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:50:19,367 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 5 states. [2020-10-20 05:50:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:19,490 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2020-10-20 05:50:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:50:19,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 05:50:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:19,492 INFO L225 Difference]: With dead ends: 75 [2020-10-20 05:50:19,492 INFO L226 Difference]: Without dead ends: 75 [2020-10-20 05:50:19,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-20 05:50:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2020-10-20 05:50:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 05:50:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2020-10-20 05:50:19,502 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 13 [2020-10-20 05:50:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:19,503 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2020-10-20 05:50:19,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:50:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2020-10-20 05:50:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:50:19,508 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:19,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:19,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 05:50:19,509 INFO L429 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash 419424128, now seen corresponding path program 1 times [2020-10-20 05:50:19,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:19,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883175026] [2020-10-20 05:50:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:19,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883175026] [2020-10-20 05:50:19,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:19,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:50:19,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515340884] [2020-10-20 05:50:19,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:50:19,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:50:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:19,635 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 6 states. [2020-10-20 05:50:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:19,800 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2020-10-20 05:50:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:50:19,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 05:50:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:19,801 INFO L225 Difference]: With dead ends: 78 [2020-10-20 05:50:19,802 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 05:50:19,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 05:50:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2020-10-20 05:50:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 05:50:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2020-10-20 05:50:19,807 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 13 [2020-10-20 05:50:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:19,808 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2020-10-20 05:50:19,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:50:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2020-10-20 05:50:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 05:50:19,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:19,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:19,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 05:50:19,809 INFO L429 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:19,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1657762862, now seen corresponding path program 1 times [2020-10-20 05:50:19,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:19,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230002197] [2020-10-20 05:50:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:19,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230002197] [2020-10-20 05:50:19,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:19,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 05:50:19,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976534752] [2020-10-20 05:50:19,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:50:19,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:19,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:50:19,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:50:19,871 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 5 states. [2020-10-20 05:50:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:19,977 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-10-20 05:50:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:50:19,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 05:50:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:19,979 INFO L225 Difference]: With dead ends: 68 [2020-10-20 05:50:19,979 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 05:50:19,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 05:50:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-20 05:50:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-20 05:50:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2020-10-20 05:50:19,985 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 14 [2020-10-20 05:50:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:19,985 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2020-10-20 05:50:19,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:50:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2020-10-20 05:50:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 05:50:19,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:19,987 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:19,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 05:50:19,987 INFO L429 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash 877584251, now seen corresponding path program 1 times [2020-10-20 05:50:19,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:19,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511124970] [2020-10-20 05:50:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:20,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:20,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511124970] [2020-10-20 05:50:20,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417668171] [2020-10-20 05:50:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:20,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 05:50:20,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:20,256 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:20,256 INFO L384 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 25 [2020-10-20 05:50:20,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:20,288 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-10-20 05:50:20,296 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:20,296 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-10-20 05:50:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:20,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:20,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-10-20 05:50:20,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387938083] [2020-10-20 05:50:20,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:50:20,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:20,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:50:20,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:20,357 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 7 states. [2020-10-20 05:50:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:20,533 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2020-10-20 05:50:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:50:20,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-20 05:50:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:20,535 INFO L225 Difference]: With dead ends: 87 [2020-10-20 05:50:20,535 INFO L226 Difference]: Without dead ends: 87 [2020-10-20 05:50:20,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-20 05:50:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2020-10-20 05:50:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 05:50:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2020-10-20 05:50:20,541 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 15 [2020-10-20 05:50:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:20,542 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2020-10-20 05:50:20,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:50:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2020-10-20 05:50:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 05:50:20,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:20,543 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:20,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-10-20 05:50:20,755 INFO L429 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:20,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1071221763, now seen corresponding path program 1 times [2020-10-20 05:50:20,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:20,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345494178] [2020-10-20 05:50:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:20,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:20,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345494178] [2020-10-20 05:50:20,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342353742] [2020-10-20 05:50:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:20,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 05:50:20,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:20,976 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_31|]} [2020-10-20 05:50:20,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:50:20,982 INFO L384 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 [2020-10-20 05:50:20,982 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:20,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:20,996 INFO L384 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 [2020-10-20 05:50:20,998 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:21,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:21,007 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:21,007 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-10-20 05:50:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:21,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:21,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-10-20 05:50:21,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954327320] [2020-10-20 05:50:21,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:50:21,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:21,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:50:21,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:21,048 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 8 states. [2020-10-20 05:50:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:21,296 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-10-20 05:50:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:21,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-20 05:50:21,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:21,298 INFO L225 Difference]: With dead ends: 70 [2020-10-20 05:50:21,298 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 05:50:21,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:50:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 05:50:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2020-10-20 05:50:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 05:50:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2020-10-20 05:50:21,303 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 17 [2020-10-20 05:50:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:21,303 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2020-10-20 05:50:21,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:50:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-10-20 05:50:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 05:50:21,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:21,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:21,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 05:50:21,515 INFO L429 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash -528725231, now seen corresponding path program 1 times [2020-10-20 05:50:21,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:21,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137767468] [2020-10-20 05:50:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:21,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:21,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137767468] [2020-10-20 05:50:21,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:21,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:50:21,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349917977] [2020-10-20 05:50:21,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:50:21,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:50:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:21,579 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 6 states. [2020-10-20 05:50:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:21,727 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2020-10-20 05:50:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:50:21,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 05:50:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:21,729 INFO L225 Difference]: With dead ends: 59 [2020-10-20 05:50:21,730 INFO L226 Difference]: Without dead ends: 59 [2020-10-20 05:50:21,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-20 05:50:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-20 05:50:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 05:50:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2020-10-20 05:50:21,734 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 20 [2020-10-20 05:50:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:21,734 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2020-10-20 05:50:21,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:50:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2020-10-20 05:50:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 05:50:21,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:21,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:21,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 05:50:21,736 INFO L429 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -528725230, now seen corresponding path program 1 times [2020-10-20 05:50:21,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:21,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243790759] [2020-10-20 05:50:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:21,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:21,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243790759] [2020-10-20 05:50:21,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:21,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:50:21,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119042201] [2020-10-20 05:50:21,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:50:21,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:50:21,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:21,854 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 6 states. [2020-10-20 05:50:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:22,079 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2020-10-20 05:50:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:22,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 05:50:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:22,080 INFO L225 Difference]: With dead ends: 89 [2020-10-20 05:50:22,080 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 05:50:22,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:50:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 05:50:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2020-10-20 05:50:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 05:50:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2020-10-20 05:50:22,087 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 20 [2020-10-20 05:50:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:22,088 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2020-10-20 05:50:22,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:50:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2020-10-20 05:50:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 05:50:22,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:22,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:22,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 05:50:22,090 INFO L429 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -529524558, now seen corresponding path program 1 times [2020-10-20 05:50:22,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:22,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290608400] [2020-10-20 05:50:22,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:22,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290608400] [2020-10-20 05:50:22,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:22,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:50:22,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635302779] [2020-10-20 05:50:22,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:50:22,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:50:22,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:22,140 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand 7 states. [2020-10-20 05:50:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:22,320 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2020-10-20 05:50:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:22,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-20 05:50:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:22,323 INFO L225 Difference]: With dead ends: 77 [2020-10-20 05:50:22,324 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 05:50:22,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:50:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 05:50:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-20 05:50:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 05:50:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2020-10-20 05:50:22,328 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 20 [2020-10-20 05:50:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:22,328 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2020-10-20 05:50:22,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:50:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2020-10-20 05:50:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 05:50:22,330 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:22,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:22,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 05:50:22,330 INFO L429 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash -529524557, now seen corresponding path program 1 times [2020-10-20 05:50:22,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:22,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818385962] [2020-10-20 05:50:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:22,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:22,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818385962] [2020-10-20 05:50:22,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:22,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:50:22,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047378403] [2020-10-20 05:50:22,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:50:22,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:50:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:50:22,429 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand 9 states. [2020-10-20 05:50:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:22,696 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2020-10-20 05:50:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:50:22,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-20 05:50:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:22,698 INFO L225 Difference]: With dead ends: 104 [2020-10-20 05:50:22,698 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 05:50:22,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:50:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 05:50:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2020-10-20 05:50:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-20 05:50:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2020-10-20 05:50:22,703 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 20 [2020-10-20 05:50:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:22,704 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2020-10-20 05:50:22,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:50:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2020-10-20 05:50:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 05:50:22,705 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:22,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:22,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 05:50:22,705 INFO L429 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1115531244, now seen corresponding path program 1 times [2020-10-20 05:50:22,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:22,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336351315] [2020-10-20 05:50:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:22,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:22,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336351315] [2020-10-20 05:50:22,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:22,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:50:22,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108788399] [2020-10-20 05:50:22,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:50:22,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:50:22,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:22,779 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand 8 states. [2020-10-20 05:50:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:22,997 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2020-10-20 05:50:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:22,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-20 05:50:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:22,998 INFO L225 Difference]: With dead ends: 103 [2020-10-20 05:50:22,998 INFO L226 Difference]: Without dead ends: 103 [2020-10-20 05:50:22,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:50:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-20 05:50:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2020-10-20 05:50:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 05:50:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2020-10-20 05:50:23,003 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 117 transitions. Word has length 20 [2020-10-20 05:50:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:23,004 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 117 transitions. [2020-10-20 05:50:23,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:50:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2020-10-20 05:50:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 05:50:23,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:23,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:23,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 05:50:23,006 INFO L429 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash 764607877, now seen corresponding path program 1 times [2020-10-20 05:50:23,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:23,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683338109] [2020-10-20 05:50:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:23,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683338109] [2020-10-20 05:50:23,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:23,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:50:23,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424634299] [2020-10-20 05:50:23,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:50:23,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:23,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:50:23,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:23,057 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. Second operand 7 states. [2020-10-20 05:50:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:23,208 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2020-10-20 05:50:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:23,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-20 05:50:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:23,211 INFO L225 Difference]: With dead ends: 88 [2020-10-20 05:50:23,211 INFO L226 Difference]: Without dead ends: 88 [2020-10-20 05:50:23,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:50:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-20 05:50:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-10-20 05:50:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-20 05:50:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2020-10-20 05:50:23,217 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 21 [2020-10-20 05:50:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:23,217 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2020-10-20 05:50:23,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:50:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2020-10-20 05:50:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 05:50:23,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:23,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:23,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 05:50:23,218 INFO L429 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash 764607878, now seen corresponding path program 1 times [2020-10-20 05:50:23,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:23,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52743660] [2020-10-20 05:50:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:23,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52743660] [2020-10-20 05:50:23,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:23,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:50:23,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043805657] [2020-10-20 05:50:23,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:50:23,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:50:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:50:23,309 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand 9 states. [2020-10-20 05:50:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:23,591 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2020-10-20 05:50:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:50:23,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-20 05:50:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:23,593 INFO L225 Difference]: With dead ends: 106 [2020-10-20 05:50:23,593 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 05:50:23,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:50:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 05:50:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2020-10-20 05:50:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-20 05:50:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2020-10-20 05:50:23,601 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 21 [2020-10-20 05:50:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:23,601 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2020-10-20 05:50:23,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:50:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2020-10-20 05:50:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 05:50:23,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:23,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:23,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 05:50:23,603 INFO L429 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -221725122, now seen corresponding path program 1 times [2020-10-20 05:50:23,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:23,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026072711] [2020-10-20 05:50:23,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:23,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026072711] [2020-10-20 05:50:23,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:23,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:50:23,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920914262] [2020-10-20 05:50:23,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:50:23,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:50:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:23,680 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand 7 states. [2020-10-20 05:50:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:23,835 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2020-10-20 05:50:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:23,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-20 05:50:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:23,836 INFO L225 Difference]: With dead ends: 89 [2020-10-20 05:50:23,836 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 05:50:23,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:50:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 05:50:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-20 05:50:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 05:50:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2020-10-20 05:50:23,842 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 21 [2020-10-20 05:50:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:23,842 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2020-10-20 05:50:23,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:50:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2020-10-20 05:50:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 05:50:23,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:23,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:23,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 05:50:23,844 INFO L429 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:23,844 INFO L82 PathProgramCache]: Analyzing trace with hash -221725121, now seen corresponding path program 1 times [2020-10-20 05:50:23,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:23,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757254803] [2020-10-20 05:50:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:23,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757254803] [2020-10-20 05:50:23,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:23,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:50:23,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012664582] [2020-10-20 05:50:23,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:50:23,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:50:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:50:23,969 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand 9 states. [2020-10-20 05:50:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:24,229 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2020-10-20 05:50:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:50:24,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-20 05:50:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:24,231 INFO L225 Difference]: With dead ends: 101 [2020-10-20 05:50:24,235 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 05:50:24,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:50:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 05:50:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2020-10-20 05:50:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 05:50:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2020-10-20 05:50:24,242 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 21 [2020-10-20 05:50:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:24,242 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2020-10-20 05:50:24,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:50:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2020-10-20 05:50:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 05:50:24,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:24,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:24,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 05:50:24,244 INFO L429 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1861053024, now seen corresponding path program 1 times [2020-10-20 05:50:24,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:24,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090338071] [2020-10-20 05:50:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:24,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:24,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-20 05:50:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:24,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090338071] [2020-10-20 05:50:24,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:24,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:50:24,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865577505] [2020-10-20 05:50:24,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:50:24,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:50:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:50:24,287 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand 5 states. [2020-10-20 05:50:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:24,436 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2020-10-20 05:50:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:24,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-10-20 05:50:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:24,437 INFO L225 Difference]: With dead ends: 134 [2020-10-20 05:50:24,438 INFO L226 Difference]: Without dead ends: 134 [2020-10-20 05:50:24,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-20 05:50:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2020-10-20 05:50:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-20 05:50:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-10-20 05:50:24,443 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 23 [2020-10-20 05:50:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:24,443 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-10-20 05:50:24,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:50:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-10-20 05:50:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 05:50:24,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:24,445 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:24,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 05:50:24,445 INFO L429 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 246619296, now seen corresponding path program 1 times [2020-10-20 05:50:24,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:24,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559009853] [2020-10-20 05:50:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:24,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 05:50:24,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559009853] [2020-10-20 05:50:24,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:24,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:50:24,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407631187] [2020-10-20 05:50:24,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:50:24,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:50:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:24,528 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 8 states. [2020-10-20 05:50:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:24,768 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2020-10-20 05:50:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:50:24,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-20 05:50:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:24,770 INFO L225 Difference]: With dead ends: 133 [2020-10-20 05:50:24,770 INFO L226 Difference]: Without dead ends: 133 [2020-10-20 05:50:24,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-20 05:50:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-20 05:50:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2020-10-20 05:50:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 05:50:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2020-10-20 05:50:24,775 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 24 [2020-10-20 05:50:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:24,775 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2020-10-20 05:50:24,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:50:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2020-10-20 05:50:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:50:24,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:24,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:24,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 05:50:24,776 INFO L429 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash 152894738, now seen corresponding path program 1 times [2020-10-20 05:50:24,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:24,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641842080] [2020-10-20 05:50:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:24,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:24,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641842080] [2020-10-20 05:50:24,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:24,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:50:24,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251332574] [2020-10-20 05:50:24,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:50:24,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:24,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:50:24,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:24,869 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand 7 states. [2020-10-20 05:50:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:25,113 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2020-10-20 05:50:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:50:25,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-20 05:50:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:25,115 INFO L225 Difference]: With dead ends: 117 [2020-10-20 05:50:25,115 INFO L226 Difference]: Without dead ends: 117 [2020-10-20 05:50:25,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:50:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-20 05:50:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2020-10-20 05:50:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-20 05:50:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2020-10-20 05:50:25,120 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 25 [2020-10-20 05:50:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:25,121 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2020-10-20 05:50:25,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:50:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2020-10-20 05:50:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:50:25,121 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:25,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:25,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 05:50:25,122 INFO L429 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash -291874421, now seen corresponding path program 1 times [2020-10-20 05:50:25,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:25,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131054370] [2020-10-20 05:50:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:25,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:25,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-20 05:50:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:25,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131054370] [2020-10-20 05:50:25,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:25,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:50:25,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041292593] [2020-10-20 05:50:25,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:50:25,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:50:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:25,223 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand 8 states. [2020-10-20 05:50:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:25,786 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2020-10-20 05:50:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 05:50:25,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-10-20 05:50:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:25,789 INFO L225 Difference]: With dead ends: 211 [2020-10-20 05:50:25,789 INFO L226 Difference]: Without dead ends: 208 [2020-10-20 05:50:25,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-10-20 05:50:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-20 05:50:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 113. [2020-10-20 05:50:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-20 05:50:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2020-10-20 05:50:25,801 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 25 [2020-10-20 05:50:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:25,801 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2020-10-20 05:50:25,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:50:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2020-10-20 05:50:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:50:25,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:25,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:25,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 05:50:25,802 INFO L429 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:25,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1841249968, now seen corresponding path program 1 times [2020-10-20 05:50:25,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:25,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765714484] [2020-10-20 05:50:25,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:25,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:25,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765714484] [2020-10-20 05:50:25,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:25,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 05:50:25,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423420134] [2020-10-20 05:50:25,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:50:25,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:50:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:50:25,910 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand 9 states. [2020-10-20 05:50:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:26,211 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2020-10-20 05:50:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:50:26,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-20 05:50:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:26,212 INFO L225 Difference]: With dead ends: 110 [2020-10-20 05:50:26,212 INFO L226 Difference]: Without dead ends: 110 [2020-10-20 05:50:26,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-20 05:50:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-20 05:50:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2020-10-20 05:50:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 05:50:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2020-10-20 05:50:26,221 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 25 [2020-10-20 05:50:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:26,222 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2020-10-20 05:50:26,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:50:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2020-10-20 05:50:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:50:26,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:26,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:26,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 05:50:26,223 INFO L429 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:26,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2008948169, now seen corresponding path program 1 times [2020-10-20 05:50:26,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:26,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559372167] [2020-10-20 05:50:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:26,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:26,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-20 05:50:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:26,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559372167] [2020-10-20 05:50:26,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:26,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 05:50:26,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922570122] [2020-10-20 05:50:26,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 05:50:26,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:26,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 05:50:26,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:50:26,389 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 10 states. [2020-10-20 05:50:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:27,056 INFO L93 Difference]: Finished difference Result 187 states and 222 transitions. [2020-10-20 05:50:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-20 05:50:27,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-20 05:50:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:27,058 INFO L225 Difference]: With dead ends: 187 [2020-10-20 05:50:27,058 INFO L226 Difference]: Without dead ends: 184 [2020-10-20 05:50:27,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2020-10-20 05:50:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-20 05:50:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 85. [2020-10-20 05:50:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-20 05:50:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2020-10-20 05:50:27,064 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 25 [2020-10-20 05:50:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:27,065 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2020-10-20 05:50:27,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 05:50:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2020-10-20 05:50:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 05:50:27,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:27,066 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:27,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 05:50:27,066 INFO L429 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1646515733, now seen corresponding path program 1 times [2020-10-20 05:50:27,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:27,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123339602] [2020-10-20 05:50:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:27,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 05:50:27,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123339602] [2020-10-20 05:50:27,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:27,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:50:27,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078200751] [2020-10-20 05:50:27,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:50:27,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:50:27,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:27,169 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 6 states. [2020-10-20 05:50:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:27,352 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2020-10-20 05:50:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:27,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-20 05:50:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:27,354 INFO L225 Difference]: With dead ends: 107 [2020-10-20 05:50:27,354 INFO L226 Difference]: Without dead ends: 107 [2020-10-20 05:50:27,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:50:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-20 05:50:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2020-10-20 05:50:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 05:50:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2020-10-20 05:50:27,359 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 26 [2020-10-20 05:50:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:27,359 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2020-10-20 05:50:27,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:50:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2020-10-20 05:50:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 05:50:27,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:27,360 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:27,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 05:50:27,360 INFO L429 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash -42428009, now seen corresponding path program 1 times [2020-10-20 05:50:27,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:27,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130158480] [2020-10-20 05:50:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:27,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 05:50:27,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130158480] [2020-10-20 05:50:27,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:27,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:50:27,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459104669] [2020-10-20 05:50:27,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:50:27,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:27,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:50:27,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:27,445 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 8 states. [2020-10-20 05:50:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:27,661 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2020-10-20 05:50:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:50:27,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-20 05:50:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:27,662 INFO L225 Difference]: With dead ends: 110 [2020-10-20 05:50:27,662 INFO L226 Difference]: Without dead ends: 110 [2020-10-20 05:50:27,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-20 05:50:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-20 05:50:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2020-10-20 05:50:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-20 05:50:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2020-10-20 05:50:27,666 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 26 [2020-10-20 05:50:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:27,666 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2020-10-20 05:50:27,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:50:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2020-10-20 05:50:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 05:50:27,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:27,667 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:27,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 05:50:27,667 INFO L429 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:27,668 INFO L82 PathProgramCache]: Analyzing trace with hash -898957707, now seen corresponding path program 1 times [2020-10-20 05:50:27,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:27,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489613755] [2020-10-20 05:50:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:27,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:27,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489613755] [2020-10-20 05:50:27,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:27,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 05:50:27,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276582522] [2020-10-20 05:50:27,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 05:50:27,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 05:50:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:50:27,801 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 11 states. [2020-10-20 05:50:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:28,135 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2020-10-20 05:50:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 05:50:28,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-20 05:50:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:28,137 INFO L225 Difference]: With dead ends: 137 [2020-10-20 05:50:28,137 INFO L226 Difference]: Without dead ends: 137 [2020-10-20 05:50:28,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-20 05:50:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-20 05:50:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2020-10-20 05:50:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-20 05:50:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2020-10-20 05:50:28,142 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 27 [2020-10-20 05:50:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:28,142 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2020-10-20 05:50:28,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 05:50:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2020-10-20 05:50:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 05:50:28,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:28,144 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:28,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 05:50:28,144 INFO L429 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash -476255881, now seen corresponding path program 1 times [2020-10-20 05:50:28,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:28,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687775780] [2020-10-20 05:50:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:28,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:28,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687775780] [2020-10-20 05:50:28,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:28,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 05:50:28,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769574597] [2020-10-20 05:50:28,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:50:28,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:50:28,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:50:28,323 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 12 states. [2020-10-20 05:50:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:28,706 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2020-10-20 05:50:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:50:28,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-10-20 05:50:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:28,708 INFO L225 Difference]: With dead ends: 189 [2020-10-20 05:50:28,708 INFO L226 Difference]: Without dead ends: 189 [2020-10-20 05:50:28,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-20 05:50:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-20 05:50:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 128. [2020-10-20 05:50:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-20 05:50:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2020-10-20 05:50:28,714 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2020-10-20 05:50:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:28,715 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2020-10-20 05:50:28,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:50:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2020-10-20 05:50:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:50:28,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:28,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:28,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 05:50:28,716 INFO L429 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash 953203027, now seen corresponding path program 1 times [2020-10-20 05:50:28,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:28,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995624747] [2020-10-20 05:50:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:28,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:28,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995624747] [2020-10-20 05:50:28,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856167669] [2020-10-20 05:50:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:28,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core [2020-10-20 05:50:28,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:29,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:29,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-10-20 05:50:29,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063536180] [2020-10-20 05:50:29,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 05:50:29,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 05:50:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:50:29,030 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand 16 states. [2020-10-20 05:50:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:29,620 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2020-10-20 05:50:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:50:29,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2020-10-20 05:50:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:29,622 INFO L225 Difference]: With dead ends: 158 [2020-10-20 05:50:29,622 INFO L226 Difference]: Without dead ends: 158 [2020-10-20 05:50:29,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2020-10-20 05:50:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-20 05:50:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2020-10-20 05:50:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-20 05:50:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2020-10-20 05:50:29,629 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 29 [2020-10-20 05:50:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:29,629 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2020-10-20 05:50:29,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 05:50:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2020-10-20 05:50:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:50:29,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:29,630 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:29,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:29,841 INFO L429 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash 953237848, now seen corresponding path program 1 times [2020-10-20 05:50:29,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:29,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685580861] [2020-10-20 05:50:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:29,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:29,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685580861] [2020-10-20 05:50:29,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880690940] [2020-10-20 05:50:29,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:30,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 05:50:30,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:30,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:30,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-10-20 05:50:30,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89853529] [2020-10-20 05:50:30,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:50:30,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:50:30,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:50:30,151 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand 12 states. [2020-10-20 05:50:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:30,571 INFO L93 Difference]: Finished difference Result 201 states and 241 transitions. [2020-10-20 05:50:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:50:30,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2020-10-20 05:50:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:30,572 INFO L225 Difference]: With dead ends: 201 [2020-10-20 05:50:30,573 INFO L226 Difference]: Without dead ends: 201 [2020-10-20 05:50:30,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2020-10-20 05:50:30,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-20 05:50:30,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2020-10-20 05:50:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-20 05:50:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2020-10-20 05:50:30,581 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 29 [2020-10-20 05:50:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:30,581 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2020-10-20 05:50:30,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:50:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2020-10-20 05:50:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:50:30,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:30,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:30,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:30,783 INFO L429 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:30,784 INFO L82 PathProgramCache]: Analyzing trace with hash 508433868, now seen corresponding path program 1 times [2020-10-20 05:50:30,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:30,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589191862] [2020-10-20 05:50:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:30,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:30,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-10-20 05:50:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:30,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589191862] [2020-10-20 05:50:30,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:30,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:50:30,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287757098] [2020-10-20 05:50:30,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:50:30,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:50:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:50:30,878 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand 7 states. [2020-10-20 05:50:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:31,187 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2020-10-20 05:50:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:50:31,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-10-20 05:50:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:31,190 INFO L225 Difference]: With dead ends: 196 [2020-10-20 05:50:31,190 INFO L226 Difference]: Without dead ends: 195 [2020-10-20 05:50:31,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:50:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-10-20 05:50:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 170. [2020-10-20 05:50:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-20 05:50:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 206 transitions. [2020-10-20 05:50:31,199 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 206 transitions. Word has length 29 [2020-10-20 05:50:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:31,199 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 206 transitions. [2020-10-20 05:50:31,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:50:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 206 transitions. [2020-10-20 05:50:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 05:50:31,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:31,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:31,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-20 05:50:31,202 INFO L429 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1770840197, now seen corresponding path program 1 times [2020-10-20 05:50:31,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:31,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821543515] [2020-10-20 05:50:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:31,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:31,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-20 05:50:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:31,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821543515] [2020-10-20 05:50:31,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:50:31,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:50:31,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827813300] [2020-10-20 05:50:31,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:50:31,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:50:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:50:31,284 INFO L87 Difference]: Start difference. First operand 170 states and 206 transitions. Second operand 6 states. [2020-10-20 05:50:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:31,460 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2020-10-20 05:50:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:50:31,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-10-20 05:50:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:31,461 INFO L225 Difference]: With dead ends: 186 [2020-10-20 05:50:31,462 INFO L226 Difference]: Without dead ends: 133 [2020-10-20 05:50:31,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:50:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-20 05:50:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2020-10-20 05:50:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-10-20 05:50:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2020-10-20 05:50:31,466 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 30 [2020-10-20 05:50:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:31,466 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2020-10-20 05:50:31,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:50:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2020-10-20 05:50:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-20 05:50:31,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:31,467 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:31,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-20 05:50:31,468 INFO L429 AbstractCegarLoop]: === Iteration 34 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:31,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1800341638, now seen corresponding path program 1 times [2020-10-20 05:50:31,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:31,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130035685] [2020-10-20 05:50:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:31,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:31,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130035685] [2020-10-20 05:50:31,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137164213] [2020-10-20 05:50:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:31,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2020-10-20 05:50:31,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:31,665 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:31,666 INFO L384 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 25 [2020-10-20 05:50:31,666 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:31,685 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-10-20 05:50:31,687 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:31,687 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-10-20 05:50:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:31,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:31,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-10-20 05:50:31,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770346912] [2020-10-20 05:50:31,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 05:50:31,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 05:50:31,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:50:31,829 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand 16 states. [2020-10-20 05:50:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:32,548 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2020-10-20 05:50:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:50:32,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2020-10-20 05:50:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:32,550 INFO L225 Difference]: With dead ends: 153 [2020-10-20 05:50:32,550 INFO L226 Difference]: Without dead ends: 153 [2020-10-20 05:50:32,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2020-10-20 05:50:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-20 05:50:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2020-10-20 05:50:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-20 05:50:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2020-10-20 05:50:32,554 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 31 [2020-10-20 05:50:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:32,555 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2020-10-20 05:50:32,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 05:50:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2020-10-20 05:50:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 05:50:32,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:32,556 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:32,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-10-20 05:50:32,766 INFO L429 AbstractCegarLoop]: === Iteration 35 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash -416327131, now seen corresponding path program 1 times [2020-10-20 05:50:32,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:32,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540101068] [2020-10-20 05:50:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:32,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 05:50:32,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540101068] [2020-10-20 05:50:32,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745610097] [2020-10-20 05:50:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:32,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2020-10-20 05:50:32,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:32,979 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 05:50:32,980 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:32,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:32,982 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:32,982 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-20 05:50:33,038 INFO L384 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 [2020-10-20 05:50:33,038 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:33,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:33,040 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:33,040 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-20 05:50:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:33,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 05:50:33,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2020-10-20 05:50:33,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538924976] [2020-10-20 05:50:33,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:50:33,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:33,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:50:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-10-20 05:50:33,057 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand 8 states. [2020-10-20 05:50:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:33,197 INFO L93 Difference]: Finished difference Result 168 states and 192 transitions. [2020-10-20 05:50:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:50:33,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-10-20 05:50:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:33,200 INFO L225 Difference]: With dead ends: 168 [2020-10-20 05:50:33,200 INFO L226 Difference]: Without dead ends: 158 [2020-10-20 05:50:33,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-10-20 05:50:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-20 05:50:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2020-10-20 05:50:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-20 05:50:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 174 transitions. [2020-10-20 05:50:33,204 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 174 transitions. Word has length 32 [2020-10-20 05:50:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:33,205 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 174 transitions. [2020-10-20 05:50:33,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:50:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2020-10-20 05:50:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 05:50:33,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:33,206 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:33,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:33,415 INFO L429 AbstractCegarLoop]: === Iteration 36 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash -354287517, now seen corresponding path program 1 times [2020-10-20 05:50:33,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:33,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302185365] [2020-10-20 05:50:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:33,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 05:50:33,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302185365] [2020-10-20 05:50:33,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078496189] [2020-10-20 05:50:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:33,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-20 05:50:33,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:33,666 INFO L384 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 [2020-10-20 05:50:33,666 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:33,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:33,673 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:33,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2020-10-20 05:50:33,807 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:33,807 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-10-20 05:50:33,808 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 05:50:33,819 INFO L625 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2020-10-20 05:50:33,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:33,821 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:3 [2020-10-20 05:50:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:33,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 05:50:33,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2020-10-20 05:50:33,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662942850] [2020-10-20 05:50:33,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 05:50:33,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 05:50:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-10-20 05:50:33,842 INFO L87 Difference]: Start difference. First operand 151 states and 174 transitions. Second operand 10 states. [2020-10-20 05:50:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:34,104 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2020-10-20 05:50:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:50:34,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2020-10-20 05:50:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:34,106 INFO L225 Difference]: With dead ends: 157 [2020-10-20 05:50:34,106 INFO L226 Difference]: Without dead ends: 147 [2020-10-20 05:50:34,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-10-20 05:50:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-20 05:50:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2020-10-20 05:50:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-20 05:50:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2020-10-20 05:50:34,110 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 32 [2020-10-20 05:50:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:34,110 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2020-10-20 05:50:34,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 05:50:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2020-10-20 05:50:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-20 05:50:34,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:34,111 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:34,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-10-20 05:50:34,321 INFO L429 AbstractCegarLoop]: === Iteration 37 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:34,321 INFO L82 PathProgramCache]: Analyzing trace with hash 856692413, now seen corresponding path program 1 times [2020-10-20 05:50:34,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:34,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345919062] [2020-10-20 05:50:34,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:34,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:34,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345919062] [2020-10-20 05:50:34,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502477312] [2020-10-20 05:50:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:34,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 05:50:34,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 05:50:34,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 05:50:34,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2020-10-20 05:50:34,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373420483] [2020-10-20 05:50:34,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:50:34,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:50:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-10-20 05:50:34,603 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 6 states. [2020-10-20 05:50:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:34,647 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2020-10-20 05:50:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:50:34,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-10-20 05:50:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:34,649 INFO L225 Difference]: With dead ends: 117 [2020-10-20 05:50:34,649 INFO L226 Difference]: Without dead ends: 117 [2020-10-20 05:50:34,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:50:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-20 05:50:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2020-10-20 05:50:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-20 05:50:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2020-10-20 05:50:34,653 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 34 [2020-10-20 05:50:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:34,653 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2020-10-20 05:50:34,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:50:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2020-10-20 05:50:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-20 05:50:34,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:34,654 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:34,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-10-20 05:50:34,863 INFO L429 AbstractCegarLoop]: === Iteration 38 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1573852549, now seen corresponding path program 2 times [2020-10-20 05:50:34,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:34,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041845560] [2020-10-20 05:50:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:35,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:35,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041845560] [2020-10-20 05:50:35,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211906545] [2020-10-20 05:50:35,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:35,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 05:50:35,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:50:35,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 46 conjunts are in the unsatisfiable core [2020-10-20 05:50:35,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:35,276 INFO L384 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 [2020-10-20 05:50:35,281 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:35,291 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:35,291 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:35,292 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-10-20 05:50:35,410 INFO L384 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 [2020-10-20 05:50:35,411 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:35,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:35,423 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:35,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-10-20 05:50:35,611 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2020-10-20 05:50:35,612 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:35,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:35,627 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:35,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-20 05:50:35,885 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:50:35,886 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2020-10-20 05:50:35,888 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:35,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:35,913 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:35,913 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2020-10-20 05:50:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:35,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:35,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2020-10-20 05:50:35,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832929752] [2020-10-20 05:50:35,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-20 05:50:35,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-20 05:50:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2020-10-20 05:50:35,923 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand 25 states. [2020-10-20 05:50:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:37,056 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2020-10-20 05:50:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 05:50:37,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2020-10-20 05:50:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:37,058 INFO L225 Difference]: With dead ends: 175 [2020-10-20 05:50:37,058 INFO L226 Difference]: Without dead ends: 157 [2020-10-20 05:50:37,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2020-10-20 05:50:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-20 05:50:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-10-20 05:50:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-20 05:50:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2020-10-20 05:50:37,063 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 34 [2020-10-20 05:50:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:37,063 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2020-10-20 05:50:37,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-20 05:50:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2020-10-20 05:50:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 05:50:37,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:37,064 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:37,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-10-20 05:50:37,267 INFO L429 AbstractCegarLoop]: === Iteration 39 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:37,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:37,268 INFO L82 PathProgramCache]: Analyzing trace with hash 787503383, now seen corresponding path program 1 times [2020-10-20 05:50:37,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:37,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021236660] [2020-10-20 05:50:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:37,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:37,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021236660] [2020-10-20 05:50:37,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542254671] [2020-10-20 05:50:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:37,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 05:50:37,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 05:50:37,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:37,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2020-10-20 05:50:37,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647238008] [2020-10-20 05:50:37,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-20 05:50:37,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:37,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 05:50:37,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-20 05:50:37,639 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 17 states. [2020-10-20 05:50:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:38,399 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2020-10-20 05:50:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 05:50:38,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-10-20 05:50:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:38,400 INFO L225 Difference]: With dead ends: 222 [2020-10-20 05:50:38,400 INFO L226 Difference]: Without dead ends: 174 [2020-10-20 05:50:38,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2020-10-20 05:50:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-20 05:50:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 118. [2020-10-20 05:50:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-20 05:50:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2020-10-20 05:50:38,411 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 35 [2020-10-20 05:50:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:38,411 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2020-10-20 05:50:38,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-20 05:50:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2020-10-20 05:50:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 05:50:38,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:38,414 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:38,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-20 05:50:38,623 INFO L429 AbstractCegarLoop]: === Iteration 40 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash -551775712, now seen corresponding path program 1 times [2020-10-20 05:50:38,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:38,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181449073] [2020-10-20 05:50:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:38,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 05:50:38,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181449073] [2020-10-20 05:50:38,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808366412] [2020-10-20 05:50:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:38,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2020-10-20 05:50:38,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:38,839 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:38,840 INFO L384 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 25 [2020-10-20 05:50:38,840 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:38,859 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-10-20 05:50:38,862 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:38,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-10-20 05:50:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 05:50:39,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:39,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-10-20 05:50:39,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852212067] [2020-10-20 05:50:39,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 05:50:39,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:39,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 05:50:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:50:39,010 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 16 states. [2020-10-20 05:50:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:39,458 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2020-10-20 05:50:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:50:39,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2020-10-20 05:50:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:39,459 INFO L225 Difference]: With dead ends: 122 [2020-10-20 05:50:39,460 INFO L226 Difference]: Without dead ends: 122 [2020-10-20 05:50:39,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2020-10-20 05:50:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-20 05:50:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2020-10-20 05:50:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-20 05:50:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2020-10-20 05:50:39,463 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 37 [2020-10-20 05:50:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:39,463 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2020-10-20 05:50:39,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 05:50:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2020-10-20 05:50:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 05:50:39,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:39,464 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:39,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-20 05:50:39,674 INFO L429 AbstractCegarLoop]: === Iteration 41 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:39,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1772958174, now seen corresponding path program 3 times [2020-10-20 05:50:39,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:39,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498041599] [2020-10-20 05:50:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:39,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:39,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498041599] [2020-10-20 05:50:39,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49845135] [2020-10-20 05:50:39,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:39,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 05:50:39,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:50:39,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-20 05:50:39,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:40,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:40,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2020-10-20 05:50:40,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749244314] [2020-10-20 05:50:40,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-20 05:50:40,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 05:50:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2020-10-20 05:50:40,085 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 21 states. [2020-10-20 05:50:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:40,993 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2020-10-20 05:50:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 05:50:40,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-20 05:50:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:40,997 INFO L225 Difference]: With dead ends: 204 [2020-10-20 05:50:40,997 INFO L226 Difference]: Without dead ends: 204 [2020-10-20 05:50:40,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2020-10-20 05:50:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-20 05:50:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2020-10-20 05:50:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-20 05:50:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2020-10-20 05:50:41,006 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 38 [2020-10-20 05:50:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:41,006 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2020-10-20 05:50:41,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-20 05:50:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2020-10-20 05:50:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 05:50:41,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:41,008 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:41,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:41,210 INFO L429 AbstractCegarLoop]: === Iteration 42 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:41,211 INFO L82 PathProgramCache]: Analyzing trace with hash 74822073, now seen corresponding path program 1 times [2020-10-20 05:50:41,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:41,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11151001] [2020-10-20 05:50:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:41,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:41,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11151001] [2020-10-20 05:50:41,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283232045] [2020-10-20 05:50:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:41,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-20 05:50:41,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:41,437 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_33|]} [2020-10-20 05:50:41,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:50:41,441 INFO L384 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 [2020-10-20 05:50:41,442 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:41,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:41,453 INFO L384 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 [2020-10-20 05:50:41,454 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:41,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:41,463 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:41,463 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-10-20 05:50:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:41,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:41,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2020-10-20 05:50:41,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829124161] [2020-10-20 05:50:41,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-20 05:50:41,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:41,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 05:50:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-10-20 05:50:41,680 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand 21 states. [2020-10-20 05:50:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:42,445 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2020-10-20 05:50:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:50:42,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-20 05:50:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:42,450 INFO L225 Difference]: With dead ends: 207 [2020-10-20 05:50:42,450 INFO L226 Difference]: Without dead ends: 207 [2020-10-20 05:50:42,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2020-10-20 05:50:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-10-20 05:50:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 185. [2020-10-20 05:50:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-20 05:50:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 203 transitions. [2020-10-20 05:50:42,456 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 203 transitions. Word has length 38 [2020-10-20 05:50:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:42,456 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 203 transitions. [2020-10-20 05:50:42,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-20 05:50:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 203 transitions. [2020-10-20 05:50:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-20 05:50:42,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:42,457 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:42,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-10-20 05:50:42,668 INFO L429 AbstractCegarLoop]: === Iteration 43 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1726991819, now seen corresponding path program 1 times [2020-10-20 05:50:42,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:42,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825377783] [2020-10-20 05:50:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:43,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:43,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825377783] [2020-10-20 05:50:43,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625298361] [2020-10-20 05:50:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:43,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 53 conjunts are in the unsatisfiable core [2020-10-20 05:50:43,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:43,222 INFO L384 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 [2020-10-20 05:50:43,223 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:43,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:43,229 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:43,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-10-20 05:50:43,360 INFO L384 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 [2020-10-20 05:50:43,360 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:43,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:43,372 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:43,372 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2020-10-20 05:50:43,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2020-10-20 05:50:43,584 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:43,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:43,600 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:43,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2020-10-20 05:50:43,680 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2020-10-20 05:50:43,681 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:43,694 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:43,696 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:43,696 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2020-10-20 05:50:43,857 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:43,858 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2020-10-20 05:50:43,859 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 05:50:43,881 INFO L625 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2020-10-20 05:50:43,884 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:43,884 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:3 [2020-10-20 05:50:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:43,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:43,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2020-10-20 05:50:43,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837033369] [2020-10-20 05:50:43,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-20 05:50:43,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-20 05:50:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2020-10-20 05:50:43,920 INFO L87 Difference]: Start difference. First operand 185 states and 203 transitions. Second operand 26 states. [2020-10-20 05:50:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:45,345 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2020-10-20 05:50:45,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 05:50:45,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2020-10-20 05:50:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:45,347 INFO L225 Difference]: With dead ends: 194 [2020-10-20 05:50:45,347 INFO L226 Difference]: Without dead ends: 176 [2020-10-20 05:50:45,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2020-10-20 05:50:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-20 05:50:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2020-10-20 05:50:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-20 05:50:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2020-10-20 05:50:45,353 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 40 [2020-10-20 05:50:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:45,353 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2020-10-20 05:50:45,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-20 05:50:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2020-10-20 05:50:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 05:50:45,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:45,355 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:45,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:45,565 INFO L429 AbstractCegarLoop]: === Iteration 44 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1310842333, now seen corresponding path program 4 times [2020-10-20 05:50:45,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:45,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220566086] [2020-10-20 05:50:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:45,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:45,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220566086] [2020-10-20 05:50:45,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908489803] [2020-10-20 05:50:45,781 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:45,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 05:50:45,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:50:45,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 50 conjunts are in the unsatisfiable core [2020-10-20 05:50:45,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:45,891 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_27|], 1=[|v_#valid_35|]} [2020-10-20 05:50:45,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:50:45,895 INFO L384 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 [2020-10-20 05:50:45,896 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:45,904 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:45,910 INFO L384 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 [2020-10-20 05:50:45,911 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:45,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:45,918 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:45,918 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2020-10-20 05:50:46,048 INFO L384 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 15 treesize of output 11 [2020-10-20 05:50:46,048 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:46,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:46,053 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:46,053 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-10-20 05:50:46,168 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-10-20 05:50:46,169 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:46,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:46,177 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:46,177 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-10-20 05:50:46,466 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2020-10-20 05:50:46,467 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:46,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:46,487 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:50:46,488 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-10-20 05:50:46,489 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:46,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:46,500 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:46,500 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2020-10-20 05:50:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:46,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:46,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2020-10-20 05:50:46,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805174566] [2020-10-20 05:50:46,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-20 05:50:46,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:46,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-20 05:50:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2020-10-20 05:50:46,512 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 28 states. [2020-10-20 05:50:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:48,371 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2020-10-20 05:50:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-20 05:50:48,371 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2020-10-20 05:50:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:48,373 INFO L225 Difference]: With dead ends: 246 [2020-10-20 05:50:48,373 INFO L226 Difference]: Without dead ends: 225 [2020-10-20 05:50:48,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=257, Invalid=1999, Unknown=0, NotChecked=0, Total=2256 [2020-10-20 05:50:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-20 05:50:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 180. [2020-10-20 05:50:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-20 05:50:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2020-10-20 05:50:48,377 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 41 [2020-10-20 05:50:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:48,377 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2020-10-20 05:50:48,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-20 05:50:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2020-10-20 05:50:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-20 05:50:48,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:48,378 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:48,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-20 05:50:48,589 INFO L429 AbstractCegarLoop]: === Iteration 45 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1974147126, now seen corresponding path program 2 times [2020-10-20 05:50:48,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:48,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173517749] [2020-10-20 05:50:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:48,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:48,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173517749] [2020-10-20 05:50:48,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365619888] [2020-10-20 05:50:48,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:48,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 05:50:48,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:50:48,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-20 05:50:48,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:48,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:48,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2020-10-20 05:50:48,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993948039] [2020-10-20 05:50:48,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 05:50:48,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 05:50:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-10-20 05:50:48,946 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 15 states. [2020-10-20 05:50:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:49,456 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2020-10-20 05:50:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 05:50:49,457 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-10-20 05:50:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:49,458 INFO L225 Difference]: With dead ends: 203 [2020-10-20 05:50:49,459 INFO L226 Difference]: Without dead ends: 203 [2020-10-20 05:50:49,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2020-10-20 05:50:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-10-20 05:50:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 184. [2020-10-20 05:50:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-20 05:50:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 201 transitions. [2020-10-20 05:50:49,463 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 201 transitions. Word has length 42 [2020-10-20 05:50:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:49,463 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 201 transitions. [2020-10-20 05:50:49,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 05:50:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2020-10-20 05:50:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-20 05:50:49,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:49,464 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:49,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:49,677 INFO L429 AbstractCegarLoop]: === Iteration 46 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1220114784, now seen corresponding path program 1 times [2020-10-20 05:50:49,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:49,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881971745] [2020-10-20 05:50:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:49,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:49,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881971745] [2020-10-20 05:50:49,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472796628] [2020-10-20 05:50:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:49,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-20 05:50:49,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:50,014 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_36|]} [2020-10-20 05:50:50,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:50:50,018 INFO L384 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 [2020-10-20 05:50:50,018 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:50,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:50,029 INFO L384 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 [2020-10-20 05:50:50,030 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:50,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:50,038 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:50,038 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-10-20 05:50:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:50,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:50,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2020-10-20 05:50:50,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213605355] [2020-10-20 05:50:50,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-20 05:50:50,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:50,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 05:50:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-10-20 05:50:50,224 INFO L87 Difference]: Start difference. First operand 184 states and 201 transitions. Second operand 21 states. [2020-10-20 05:50:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:50,913 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2020-10-20 05:50:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:50:50,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2020-10-20 05:50:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:50,915 INFO L225 Difference]: With dead ends: 212 [2020-10-20 05:50:50,915 INFO L226 Difference]: Without dead ends: 212 [2020-10-20 05:50:50,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2020-10-20 05:50:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-10-20 05:50:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2020-10-20 05:50:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-20 05:50:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 208 transitions. [2020-10-20 05:50:50,920 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 208 transitions. Word has length 44 [2020-10-20 05:50:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:50,920 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 208 transitions. [2020-10-20 05:50:50,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-20 05:50:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 208 transitions. [2020-10-20 05:50:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-20 05:50:50,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:50,921 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:51,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-20 05:50:51,133 INFO L429 AbstractCegarLoop]: === Iteration 47 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1718113632, now seen corresponding path program 5 times [2020-10-20 05:50:51,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:51,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451239586] [2020-10-20 05:50:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:51,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:51,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451239586] [2020-10-20 05:50:51,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366241608] [2020-10-20 05:50:51,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:51,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-10-20 05:50:51,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:50:51,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 47 conjunts are in the unsatisfiable core [2020-10-20 05:50:51,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:51,454 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:51,455 INFO L384 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 25 [2020-10-20 05:50:51,455 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:51,480 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-10-20 05:50:51,481 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:51,481 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-10-20 05:50:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:51,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:51,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-10-20 05:50:51,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384021435] [2020-10-20 05:50:51,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-20 05:50:51,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:51,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-20 05:50:51,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2020-10-20 05:50:51,824 INFO L87 Difference]: Start difference. First operand 190 states and 208 transitions. Second operand 24 states. [2020-10-20 05:50:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:52,866 INFO L93 Difference]: Finished difference Result 289 states and 317 transitions. [2020-10-20 05:50:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 05:50:52,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2020-10-20 05:50:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:52,868 INFO L225 Difference]: With dead ends: 289 [2020-10-20 05:50:52,868 INFO L226 Difference]: Without dead ends: 289 [2020-10-20 05:50:52,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2020-10-20 05:50:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-20 05:50:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 255. [2020-10-20 05:50:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-10-20 05:50:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 284 transitions. [2020-10-20 05:50:52,874 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 284 transitions. Word has length 45 [2020-10-20 05:50:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:52,874 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 284 transitions. [2020-10-20 05:50:52,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-20 05:50:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 284 transitions. [2020-10-20 05:50:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 05:50:52,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:52,876 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:53,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2020-10-20 05:50:53,088 INFO L429 AbstractCegarLoop]: === Iteration 48 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:53,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash 4235297, now seen corresponding path program 1 times [2020-10-20 05:50:53,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:53,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876425432] [2020-10-20 05:50:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:53,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 05:50:53,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876425432] [2020-10-20 05:50:53,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011499850] [2020-10-20 05:50:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:53,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2020-10-20 05:50:53,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:53,582 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:53,583 INFO L384 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 25 [2020-10-20 05:50:53,583 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:53,600 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-10-20 05:50:53,602 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:53,602 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-10-20 05:50:53,695 INFO L384 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 16 treesize of output 12 [2020-10-20 05:50:53,695 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:53,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:53,705 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:53,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-10-20 05:50:53,859 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:53,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 62 [2020-10-20 05:50:53,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:53,909 INFO L625 ElimStorePlain]: treesize reduction 26, result has 66.2 percent of original size [2020-10-20 05:50:53,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 05:50:53,912 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:53,913 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:48 [2020-10-20 05:50:53,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:50:54,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:50:54,043 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-10-20 05:50:54,044 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:54,048 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:50:54,049 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2020-10-20 05:50:54,049 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:54,069 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:54,071 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-10-20 05:50:54,071 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:32 [2020-10-20 05:50:54,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:50:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 05:50:54,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:54,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2020-10-20 05:50:54,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078214124] [2020-10-20 05:50:54,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-20 05:50:54,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-20 05:50:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2020-10-20 05:50:54,225 INFO L87 Difference]: Start difference. First operand 255 states and 284 transitions. Second operand 26 states. [2020-10-20 05:50:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:50:55,938 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2020-10-20 05:50:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 05:50:55,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2020-10-20 05:50:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:50:55,941 INFO L225 Difference]: With dead ends: 251 [2020-10-20 05:50:55,941 INFO L226 Difference]: Without dead ends: 236 [2020-10-20 05:50:55,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2020-10-20 05:50:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-20 05:50:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2020-10-20 05:50:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-10-20 05:50:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 262 transitions. [2020-10-20 05:50:55,946 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 262 transitions. Word has length 46 [2020-10-20 05:50:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:50:55,946 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 262 transitions. [2020-10-20 05:50:55,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-20 05:50:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 262 transitions. [2020-10-20 05:50:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-20 05:50:55,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:50:55,948 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:50:56,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-10-20 05:50:56,159 INFO L429 AbstractCegarLoop]: === Iteration 49 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:50:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:50:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -416257385, now seen corresponding path program 2 times [2020-10-20 05:50:56,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:50:56,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644208617] [2020-10-20 05:50:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:50:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:56,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:50:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:50:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:50:56,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644208617] [2020-10-20 05:50:56,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022698066] [2020-10-20 05:50:56,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:50:56,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 05:50:56,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:50:56,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 68 conjunts are in the unsatisfiable core [2020-10-20 05:50:56,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:50:56,738 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_37|]} [2020-10-20 05:50:56,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:50:56,752 INFO L384 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 [2020-10-20 05:50:56,752 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:56,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:56,775 INFO L384 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 [2020-10-20 05:50:56,776 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:56,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:56,788 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:56,788 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2020-10-20 05:50:56,909 INFO L384 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 [2020-10-20 05:50:56,909 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:56,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:56,919 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:56,919 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-10-20 05:50:57,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-10-20 05:50:57,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:57,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:57,219 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:57,220 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:33 [2020-10-20 05:50:57,293 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-10-20 05:50:57,294 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:50:57,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:57,308 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-20 05:50:57,308 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-10-20 05:50:57,571 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:57,571 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2020-10-20 05:50:57,572 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 05:50:57,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:50:57,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 05:50:57,588 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:50:57,588 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:34 [2020-10-20 05:50:57,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:50:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:50:57,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:50:57,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2020-10-20 05:50:57,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617345806] [2020-10-20 05:50:57,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-10-20 05:50:57,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:50:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-10-20 05:50:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1114, Unknown=0, NotChecked=0, Total=1190 [2020-10-20 05:50:57,815 INFO L87 Difference]: Start difference. First operand 236 states and 262 transitions. Second operand 35 states. [2020-10-20 05:51:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:01,723 INFO L93 Difference]: Finished difference Result 276 states and 301 transitions. [2020-10-20 05:51:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-20 05:51:01,723 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2020-10-20 05:51:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:01,725 INFO L225 Difference]: With dead ends: 276 [2020-10-20 05:51:01,725 INFO L226 Difference]: Without dead ends: 255 [2020-10-20 05:51:01,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=348, Invalid=4344, Unknown=0, NotChecked=0, Total=4692 [2020-10-20 05:51:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-20 05:51:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 231. [2020-10-20 05:51:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-20 05:51:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 255 transitions. [2020-10-20 05:51:01,732 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 255 transitions. Word has length 47 [2020-10-20 05:51:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:01,732 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 255 transitions. [2020-10-20 05:51:01,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-10-20 05:51:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 255 transitions. [2020-10-20 05:51:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 05:51:01,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:01,733 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:01,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-10-20 05:51:01,934 INFO L429 AbstractCegarLoop]: === Iteration 50 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1197946721, now seen corresponding path program 6 times [2020-10-20 05:51:01,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:51:01,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731381619] [2020-10-20 05:51:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:51:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:02,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:51:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:02,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731381619] [2020-10-20 05:51:02,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312012476] [2020-10-20 05:51:02,272 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:02,401 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-10-20 05:51:02,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:51:02,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 67 conjunts are in the unsatisfiable core [2020-10-20 05:51:02,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:02,421 INFO L384 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 [2020-10-20 05:51:02,426 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:02,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:02,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:51:02,433 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-10-20 05:51:02,583 INFO L384 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 [2020-10-20 05:51:02,583 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:02,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:02,591 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:51:02,591 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2020-10-20 05:51:02,721 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 [2020-10-20 05:51:02,722 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:02,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:02,734 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-20 05:51:02,734 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2020-10-20 05:51:03,095 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:03,095 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2020-10-20 05:51:03,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 05:51:03,112 INFO L625 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2020-10-20 05:51:03,114 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:51:03,114 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:3 [2020-10-20 05:51:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:03,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:51:03,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2020-10-20 05:51:03,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787259570] [2020-10-20 05:51:03,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-10-20 05:51:03,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:51:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-10-20 05:51:03,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2020-10-20 05:51:03,124 INFO L87 Difference]: Start difference. First operand 231 states and 255 transitions. Second operand 32 states. [2020-10-20 05:51:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:04,571 INFO L93 Difference]: Finished difference Result 310 states and 339 transitions. [2020-10-20 05:51:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 05:51:04,572 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 48 [2020-10-20 05:51:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:04,574 INFO L225 Difference]: With dead ends: 310 [2020-10-20 05:51:04,574 INFO L226 Difference]: Without dead ends: 286 [2020-10-20 05:51:04,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2020-10-20 05:51:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-10-20 05:51:04,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 241. [2020-10-20 05:51:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-20 05:51:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 266 transitions. [2020-10-20 05:51:04,579 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 266 transitions. Word has length 48 [2020-10-20 05:51:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:04,580 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 266 transitions. [2020-10-20 05:51:04,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-10-20 05:51:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 266 transitions. [2020-10-20 05:51:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 05:51:04,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:04,581 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:04,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-20 05:51:04,793 INFO L429 AbstractCegarLoop]: === Iteration 51 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1105486493, now seen corresponding path program 1 times [2020-10-20 05:51:04,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:51:04,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67086127] [2020-10-20 05:51:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:51:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:05,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:51:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 05:51:05,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67086127] [2020-10-20 05:51:05,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460411540] [2020-10-20 05:51:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:05,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 05:51:05,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 05:51:05,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:51:05,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2020-10-20 05:51:05,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051923004] [2020-10-20 05:51:05,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-20 05:51:05,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:51:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 05:51:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-10-20 05:51:05,410 INFO L87 Difference]: Start difference. First operand 241 states and 266 transitions. Second operand 21 states. [2020-10-20 05:51:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:06,438 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2020-10-20 05:51:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-20 05:51:06,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2020-10-20 05:51:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:06,444 INFO L225 Difference]: With dead ends: 360 [2020-10-20 05:51:06,444 INFO L226 Difference]: Without dead ends: 297 [2020-10-20 05:51:06,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2020-10-20 05:51:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-10-20 05:51:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 257. [2020-10-20 05:51:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-10-20 05:51:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2020-10-20 05:51:06,448 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 48 [2020-10-20 05:51:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:06,448 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2020-10-20 05:51:06,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-20 05:51:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2020-10-20 05:51:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-20 05:51:06,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:06,449 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:06,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:06,650 INFO L429 AbstractCegarLoop]: === Iteration 52 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1344074940, now seen corresponding path program 3 times [2020-10-20 05:51:06,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:51:06,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125035580] [2020-10-20 05:51:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:51:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:06,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:51:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 05:51:06,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125035580] [2020-10-20 05:51:06,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188216424] [2020-10-20 05:51:06,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:06,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 05:51:06,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:51:06,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2020-10-20 05:51:06,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:06,912 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:06,912 INFO L384 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 25 [2020-10-20 05:51:06,913 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:06,934 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-10-20 05:51:06,935 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:51:06,936 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-10-20 05:51:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 05:51:07,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:51:07,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-10-20 05:51:07,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645333117] [2020-10-20 05:51:07,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 05:51:07,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:51:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 05:51:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2020-10-20 05:51:07,146 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand 20 states. [2020-10-20 05:51:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:07,986 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2020-10-20 05:51:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 05:51:07,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-10-20 05:51:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:07,988 INFO L225 Difference]: With dead ends: 262 [2020-10-20 05:51:07,989 INFO L226 Difference]: Without dead ends: 262 [2020-10-20 05:51:07,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2020-10-20 05:51:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-20 05:51:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2020-10-20 05:51:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-10-20 05:51:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2020-10-20 05:51:07,992 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 50 [2020-10-20 05:51:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:07,993 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2020-10-20 05:51:07,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 05:51:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2020-10-20 05:51:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 05:51:07,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:07,994 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:08,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-20 05:51:08,207 INFO L429 AbstractCegarLoop]: === Iteration 53 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1283349781, now seen corresponding path program 2 times [2020-10-20 05:51:08,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:51:08,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225489136] [2020-10-20 05:51:08,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:51:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:08,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:51:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 05:51:08,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225489136] [2020-10-20 05:51:08,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981315459] [2020-10-20 05:51:08,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:08,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 05:51:08,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 05:51:08,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 50 conjunts are in the unsatisfiable core [2020-10-20 05:51:08,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:08,487 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_39|]} [2020-10-20 05:51:08,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:51:08,490 INFO L384 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 [2020-10-20 05:51:08,491 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:08,496 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:08,500 INFO L384 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 [2020-10-20 05:51:08,500 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:08,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:08,506 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:51:08,506 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:18, output treesize:5 [2020-10-20 05:51:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 05:51:08,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:51:08,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2020-10-20 05:51:08,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212700590] [2020-10-20 05:51:08,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-20 05:51:08,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:51:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-20 05:51:08,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2020-10-20 05:51:08,944 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 28 states. [2020-10-20 05:51:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:11,359 INFO L93 Difference]: Finished difference Result 290 states and 311 transitions. [2020-10-20 05:51:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-20 05:51:11,359 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2020-10-20 05:51:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:11,362 INFO L225 Difference]: With dead ends: 290 [2020-10-20 05:51:11,362 INFO L226 Difference]: Without dead ends: 290 [2020-10-20 05:51:11,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=274, Invalid=2378, Unknown=0, NotChecked=0, Total=2652 [2020-10-20 05:51:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-10-20 05:51:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259. [2020-10-20 05:51:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-10-20 05:51:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 279 transitions. [2020-10-20 05:51:11,367 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 279 transitions. Word has length 51 [2020-10-20 05:51:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:11,368 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 279 transitions. [2020-10-20 05:51:11,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-20 05:51:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 279 transitions. [2020-10-20 05:51:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-20 05:51:11,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:11,369 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:11,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:11,581 INFO L429 AbstractCegarLoop]: === Iteration 54 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 533375612, now seen corresponding path program 7 times [2020-10-20 05:51:11,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:51:11,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476340426] [2020-10-20 05:51:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:51:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:11,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:51:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:11,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476340426] [2020-10-20 05:51:11,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375805839] [2020-10-20 05:51:11,792 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:11,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 56 conjunts are in the unsatisfiable core [2020-10-20 05:51:11,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:11,899 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:11,900 INFO L384 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 25 [2020-10-20 05:51:11,900 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:11,922 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-10-20 05:51:11,923 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:51:11,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-10-20 05:51:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:12,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:51:12,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2020-10-20 05:51:12,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714004976] [2020-10-20 05:51:12,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-20 05:51:12,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:51:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-20 05:51:12,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2020-10-20 05:51:12,300 INFO L87 Difference]: Start difference. First operand 259 states and 279 transitions. Second operand 28 states. [2020-10-20 05:51:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:13,725 INFO L93 Difference]: Finished difference Result 394 states and 425 transitions. [2020-10-20 05:51:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 05:51:13,726 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2020-10-20 05:51:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:13,728 INFO L225 Difference]: With dead ends: 394 [2020-10-20 05:51:13,728 INFO L226 Difference]: Without dead ends: 394 [2020-10-20 05:51:13,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2020-10-20 05:51:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-10-20 05:51:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 350. [2020-10-20 05:51:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-10-20 05:51:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 380 transitions. [2020-10-20 05:51:13,734 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 380 transitions. Word has length 52 [2020-10-20 05:51:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:13,734 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 380 transitions. [2020-10-20 05:51:13,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-20 05:51:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 380 transitions. [2020-10-20 05:51:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 05:51:13,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:13,736 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:13,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2020-10-20 05:51:13,950 INFO L429 AbstractCegarLoop]: === Iteration 55 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:13,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1136222785, now seen corresponding path program 3 times [2020-10-20 05:51:13,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:51:13,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340506692] [2020-10-20 05:51:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:51:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:13,992 ERROR L253 erpolLogProxyWrapper]: Interpolant 20 not inductive [2020-10-20 05:51:14,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-20 05:51:14,004 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-20 05:51:14,013 INFO L168 Benchmark]: Toolchain (without parser) took 57725.30 ms. Allocated memory was 42.5 MB in the beginning and 211.8 MB in the end (delta: 169.3 MB). Free memory was 19.2 MB in the beginning and 130.9 MB in the end (delta: -111.7 MB). Peak memory consumption was 57.6 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:14,013 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 31.5 MB. Free memory was 8.7 MB in the beginning and 8.7 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. [2020-10-20 05:51:14,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.68 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 18.3 MB in the beginning and 22.6 MB in the end (delta: -4.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:14,014 INFO L168 Benchmark]: Boogie Preprocessor took 69.88 ms. Allocated memory is still 44.0 MB. Free memory was 22.6 MB in the beginning and 19.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:14,014 INFO L168 Benchmark]: RCFGBuilder took 644.59 ms. Allocated memory was 44.0 MB in the beginning and 46.7 MB in the end (delta: 2.6 MB). Free memory was 19.8 MB in the beginning and 25.4 MB in the end (delta: -5.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:14,015 INFO L168 Benchmark]: TraceAbstraction took 56365.11 ms. Allocated memory was 46.7 MB in the beginning and 211.8 MB in the end (delta: 165.2 MB). Free memory was 25.0 MB in the beginning and 130.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 59.2 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:14,016 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 31.5 MB. Free memory was 8.7 MB in the beginning and 8.7 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 631.68 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 18.3 MB in the beginning and 22.6 MB in the end (delta: -4.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 69.88 ms. Allocated memory is still 44.0 MB. Free memory was 22.6 MB in the beginning and 19.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 644.59 ms. Allocated memory was 44.0 MB in the beginning and 46.7 MB in the end (delta: 2.6 MB). Free memory was 19.8 MB in the beginning and 25.4 MB in the end (delta: -5.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 56365.11 ms. Allocated memory was 46.7 MB in the beginning and 211.8 MB in the end (delta: 165.2 MB). Free memory was 25.0 MB in the beginning and 130.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 59.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 05:51:16,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:51:16,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:51:16,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:51:16,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:51:16,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:51:16,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:51:16,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:51:16,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:51:16,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:51:16,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:51:16,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:51:16,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:51:16,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:51:16,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:51:16,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:51:16,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:51:16,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:51:16,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:51:16,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:51:16,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:51:16,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:51:16,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:51:16,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:51:16,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:51:16,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:51:16,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:51:16,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:51:16,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:51:16,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:51:16,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:51:16,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:51:16,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:51:16,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:51:16,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:51:16,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:51:16,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:51:16,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:51:16,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:51:16,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:51:16,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:51:16,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-10-20 05:51:16,207 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:51:16,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:51:16,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:51:16,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:51:16,210 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:51:16,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:51:16,210 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:51:16,210 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:51:16,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:51:16,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:51:16,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:51:16,212 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:51:16,212 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:51:16,213 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:51:16,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:51:16,213 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:51:16,214 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 05:51:16,214 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 05:51:16,214 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:51:16,214 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:51:16,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:51:16,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:51:16,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:51:16,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:51:16,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:51:16,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:51:16,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:51:16,216 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 05:51:16,217 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 05:51:16,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:51:16,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 05:51:16,217 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> ab78f7d39533ea56445a9c400b78ef25527bc8ae [2020-10-20 05:51:16,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:51:16,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:51:16,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:51:16,439 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:51:16,439 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:51:16,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2020-10-20 05:51:16,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94df817f4/a8f8def304b5484897936d4556415761/FLAG33da5056e [2020-10-20 05:51:16,988 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:51:16,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2020-10-20 05:51:17,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94df817f4/a8f8def304b5484897936d4556415761/FLAG33da5056e [2020-10-20 05:51:17,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94df817f4/a8f8def304b5484897936d4556415761 [2020-10-20 05:51:17,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:51:17,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:51:17,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:51:17,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:51:17,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:51:17,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0c298d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17, skipping insertion in model container [2020-10-20 05:51:17,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:51:17,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:51:17,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:51:17,775 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:51:17,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:51:17,933 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:51:17,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17 WrapperNode [2020-10-20 05:51:17,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:51:17,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:51:17,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:51:17,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:51:17,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:17,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... [2020-10-20 05:51:18,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:51:18,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:51:18,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:51:18,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:51:18,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:51:18,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:51:18,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:51:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:51:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:51:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:51:18,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:51:18,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:51:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:51:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2020-10-20 05:51:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:51:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:51:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:51:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:51:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:51:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:51:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:51:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:51:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:51:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:51:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:51:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:51:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:51:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:51:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:51:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:51:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:51:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:51:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:51:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:51:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:51:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:51:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:51:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:51:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:51:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:51:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:51:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:51:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:51:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:51:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:51:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:51:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:51:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:51:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:51:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:51:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:51:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:51:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:51:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:51:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:51:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:51:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:51:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:51:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:51:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:51:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:51:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:51:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:51:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:51:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:51:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:51:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:51:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:51:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:51:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:51:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:51:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:51:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:51:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:51:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:51:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:51:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:51:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:51:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:51:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:51:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:51:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:51:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:51:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:51:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:51:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:51:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:51:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:51:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:51:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:51:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:51:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:51:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:51:18,124 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:51:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:51:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:51:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:51:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:51:18,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:51:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:51:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:51:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:51:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:51:18,126 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:51:18,127 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:51:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:51:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:51:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:51:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:51:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlcpy [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:51:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:51:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:51:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:51:18,742 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:51:18,742 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-20 05:51:18,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:51:18 BoogieIcfgContainer [2020-10-20 05:51:18,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:51:18,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:51:18,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:51:18,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:51:18,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:51:17" (1/3) ... [2020-10-20 05:51:18,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623114a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:51:18, skipping insertion in model container [2020-10-20 05:51:18,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:51:17" (2/3) ... [2020-10-20 05:51:18,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623114a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:51:18, skipping insertion in model container [2020-10-20 05:51:18,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:51:18" (3/3) ... [2020-10-20 05:51:18,753 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-1.i [2020-10-20 05:51:18,765 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:51:18,772 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2020-10-20 05:51:18,786 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2020-10-20 05:51:18,808 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:51:18,808 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:51:18,808 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:51:18,808 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:51:18,809 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:51:18,809 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:51:18,809 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:51:18,810 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:51:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-10-20 05:51:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:51:18,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:18,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:18,837 INFO L429 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash -646265141, now seen corresponding path program 1 times [2020-10-20 05:51:18,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:18,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645471305] [2020-10-20 05:51:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:19,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 05:51:19,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:19,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:51:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:19,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645471305] [2020-10-20 05:51:19,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:19,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 05:51:19,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504262619] [2020-10-20 05:51:19,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:51:19,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:51:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:51:19,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:51:19,156 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2020-10-20 05:51:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:19,281 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2020-10-20 05:51:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:51:19,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-20 05:51:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:19,307 INFO L225 Difference]: With dead ends: 80 [2020-10-20 05:51:19,308 INFO L226 Difference]: Without dead ends: 76 [2020-10-20 05:51:19,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:51:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-20 05:51:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2020-10-20 05:51:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 05:51:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2020-10-20 05:51:19,358 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 11 [2020-10-20 05:51:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:19,361 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2020-10-20 05:51:19,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:51:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-10-20 05:51:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:51:19,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:19,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:19,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 05:51:19,564 INFO L429 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash -644418099, now seen corresponding path program 1 times [2020-10-20 05:51:19,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:19,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133747801] [2020-10-20 05:51:19,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:19,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 05:51:19,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:19,784 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-10-20 05:51:19,785 INFO L384 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 11 [2020-10-20 05:51:19,786 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:19,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:19,805 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:51:19,805 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2020-10-20 05:51:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:19,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:51:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:19,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133747801] [2020-10-20 05:51:19,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:19,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 05:51:19,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799328365] [2020-10-20 05:51:19,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 05:51:19,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:51:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 05:51:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:51:19,840 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 3 states. [2020-10-20 05:51:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:19,934 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2020-10-20 05:51:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 05:51:19,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 05:51:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:19,937 INFO L225 Difference]: With dead ends: 57 [2020-10-20 05:51:19,937 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 05:51:19,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:51:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 05:51:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-20 05:51:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 05:51:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2020-10-20 05:51:19,945 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 11 [2020-10-20 05:51:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:19,946 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2020-10-20 05:51:19,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 05:51:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2020-10-20 05:51:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:51:19,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:19,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:20,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 05:51:20,160 INFO L429 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -644418098, now seen corresponding path program 1 times [2020-10-20 05:51:20,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:20,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631192580] [2020-10-20 05:51:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:20,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 05:51:20,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:20,354 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:20,354 INFO L384 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 25 [2020-10-20 05:51:20,355 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:20,416 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-10-20 05:51:20,419 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:51:20,419 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2020-10-20 05:51:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:20,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:51:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:20,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631192580] [2020-10-20 05:51:20,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:20,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-10-20 05:51:20,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165812076] [2020-10-20 05:51:20,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:51:20,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:51:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:51:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:51:20,608 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 6 states. [2020-10-20 05:51:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:21,074 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-10-20 05:51:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:51:21,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-20 05:51:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:21,078 INFO L225 Difference]: With dead ends: 77 [2020-10-20 05:51:21,078 INFO L226 Difference]: Without dead ends: 77 [2020-10-20 05:51:21,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:51:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-20 05:51:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2020-10-20 05:51:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-20 05:51:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2020-10-20 05:51:21,097 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 11 [2020-10-20 05:51:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:21,097 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2020-10-20 05:51:21,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:51:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2020-10-20 05:51:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:51:21,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:21,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:21,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 05:51:21,299 INFO L429 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1709409699, now seen corresponding path program 1 times [2020-10-20 05:51:21,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:21,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505417135] [2020-10-20 05:51:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:21,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 05:51:21,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:21,425 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:51:21,452 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:21,453 INFO L384 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 25 [2020-10-20 05:51:21,454 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:21,478 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-10-20 05:51:21,480 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:51:21,480 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2020-10-20 05:51:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:21,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:51:21,612 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:21,658 INFO L625 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2020-10-20 05:51:21,666 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-20 05:51:21,667 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:9 [2020-10-20 05:51:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:21,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505417135] [2020-10-20 05:51:21,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:21,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-20 05:51:21,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756017334] [2020-10-20 05:51:21,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:51:21,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:51:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:51:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:51:21,741 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2020-10-20 05:51:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:22,423 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2020-10-20 05:51:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 05:51:22,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-20 05:51:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:22,425 INFO L225 Difference]: With dead ends: 115 [2020-10-20 05:51:22,425 INFO L226 Difference]: Without dead ends: 115 [2020-10-20 05:51:22,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:51:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-20 05:51:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2020-10-20 05:51:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 05:51:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2020-10-20 05:51:22,436 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 13 [2020-10-20 05:51:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:22,436 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2020-10-20 05:51:22,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:51:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2020-10-20 05:51:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:51:22,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:22,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:22,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 05:51:22,650 INFO L429 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1709409698, now seen corresponding path program 1 times [2020-10-20 05:51:22,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:22,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605663005] [2020-10-20 05:51:22,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:22,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 05:51:22,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:22,779 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-10-20 05:51:22,780 INFO L384 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 11 [2020-10-20 05:51:22,780 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:22,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:22,786 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:51:22,787 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2020-10-20 05:51:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:22,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:51:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:22,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605663005] [2020-10-20 05:51:22,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:22,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 05:51:22,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231036904] [2020-10-20 05:51:22,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 05:51:22,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:51:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 05:51:22,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:51:22,815 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 3 states. [2020-10-20 05:51:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:22,906 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2020-10-20 05:51:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 05:51:22,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-20 05:51:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:22,907 INFO L225 Difference]: With dead ends: 72 [2020-10-20 05:51:22,908 INFO L226 Difference]: Without dead ends: 72 [2020-10-20 05:51:22,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:51:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-20 05:51:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-20 05:51:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 05:51:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2020-10-20 05:51:22,914 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 13 [2020-10-20 05:51:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:22,915 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2020-10-20 05:51:22,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 05:51:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2020-10-20 05:51:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:51:22,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:22,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:23,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-20 05:51:23,119 INFO L429 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:23,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:23,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1709409752, now seen corresponding path program 1 times [2020-10-20 05:51:23,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:23,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745514768] [2020-10-20 05:51:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:23,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 05:51:23,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:23,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:51:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:23,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745514768] [2020-10-20 05:51:23,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:23,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 05:51:23,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988242301] [2020-10-20 05:51:23,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:51:23,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:51:23,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:51:23,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:51:23,268 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 6 states. [2020-10-20 05:51:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:23,357 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2020-10-20 05:51:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:51:23,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 05:51:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:23,360 INFO L225 Difference]: With dead ends: 76 [2020-10-20 05:51:23,360 INFO L226 Difference]: Without dead ends: 76 [2020-10-20 05:51:23,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:51:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-20 05:51:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2020-10-20 05:51:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 05:51:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2020-10-20 05:51:23,366 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 13 [2020-10-20 05:51:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:23,366 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2020-10-20 05:51:23,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:51:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2020-10-20 05:51:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:51:23,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:23,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:23,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 05:51:23,574 INFO L429 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1766668001, now seen corresponding path program 1 times [2020-10-20 05:51:23,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:23,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141828818] [2020-10-20 05:51:23,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:23,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 05:51:23,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:23,712 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:23,713 INFO L384 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 25 [2020-10-20 05:51:23,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:23,748 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-10-20 05:51:23,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:51:23,754 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:51:23,754 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:22 [2020-10-20 05:51:23,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:51:23,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:51:23,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:51:23,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:51:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:23,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:51:24,211 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:24,267 INFO L625 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2020-10-20 05:51:24,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-20 05:51:24,270 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:15 [2020-10-20 05:51:24,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:51:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:51:24,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141828818] [2020-10-20 05:51:24,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:24,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-10-20 05:51:24,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139026438] [2020-10-20 05:51:24,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:51:24,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:51:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:51:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:51:24,453 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 12 states. [2020-10-20 05:51:25,051 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2020-10-20 05:51:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:51:25,672 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2020-10-20 05:51:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 05:51:25,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2020-10-20 05:51:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:51:25,673 INFO L225 Difference]: With dead ends: 95 [2020-10-20 05:51:25,673 INFO L226 Difference]: Without dead ends: 95 [2020-10-20 05:51:25,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2020-10-20 05:51:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-20 05:51:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2020-10-20 05:51:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 05:51:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2020-10-20 05:51:25,680 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 13 [2020-10-20 05:51:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:51:25,681 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2020-10-20 05:51:25,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:51:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-10-20 05:51:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 05:51:25,681 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:51:25,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:51:25,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-20 05:51:25,886 INFO L429 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 05:51:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:51:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash -753291880, now seen corresponding path program 1 times [2020-10-20 05:51:25,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:51:25,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488689754] [2020-10-20 05:51:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-20 05:51:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:25,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 05:51:25,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:25,990 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_61|]} [2020-10-20 05:51:25,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:51:25,999 INFO L384 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 [2020-10-20 05:51:25,999 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:26,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:26,031 INFO L384 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 [2020-10-20 05:51:26,032 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:26,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:26,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488689754] [2020-10-20 05:51:26,050 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:51:26,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1812362074] [2020-10-20 05:51:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 05:51:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:26,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 05:51:26,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:26,230 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_62|]} [2020-10-20 05:51:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:51:26,237 INFO L384 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 [2020-10-20 05:51:26,237 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:26,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:26,263 INFO L384 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 [2020-10-20 05:51:26,264 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:26,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:26,282 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:51:26,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816554241] [2020-10-20 05:51:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:51:26,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 05:51:26,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:51:26,457 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_63|]} [2020-10-20 05:51:26,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:51:26,466 INFO L384 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 [2020-10-20 05:51:26,467 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:26,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:26,499 INFO L384 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 [2020-10-20 05:51:26,500 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:51:26,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:51:26,521 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:51:26,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:51:26,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-20 05:51:26,522 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-20 05:51:26,522 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 05:51:27,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:51:27,155 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-20 05:51:27,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:51:27 BoogieIcfgContainer [2020-10-20 05:51:27,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 05:51:27,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 05:51:27,156 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 05:51:27,156 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 05:51:27,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:51:18" (3/4) ... [2020-10-20 05:51:27,159 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 05:51:27,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 05:51:27,160 INFO L168 Benchmark]: Toolchain (without parser) took 9909.70 ms. Allocated memory was 34.6 MB in the beginning and 80.2 MB in the end (delta: 45.6 MB). Free memory was 11.1 MB in the beginning and 28.9 MB in the end (delta: -17.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:27,161 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 33.0 MB. Free memory was 18.0 MB in the beginning and 18.0 MB in the end (delta: 42.0 kB). Peak memory consumption was 42.0 kB. Max. memory is 14.3 GB. [2020-10-20 05:51:27,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.02 ms. Allocated memory was 34.6 MB in the beginning and 46.1 MB in the end (delta: 11.5 MB). Free memory was 10.2 MB in the beginning and 22.2 MB in the end (delta: -12.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:27,163 INFO L168 Benchmark]: Boogie Preprocessor took 72.06 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 19.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:27,164 INFO L168 Benchmark]: RCFGBuilder took 736.64 ms. Allocated memory was 46.1 MB in the beginning and 48.2 MB in the end (delta: 2.1 MB). Free memory was 19.0 MB in the beginning and 17.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:27,164 INFO L168 Benchmark]: TraceAbstraction took 8409.81 ms. Allocated memory was 48.2 MB in the beginning and 80.2 MB in the end (delta: 32.0 MB). Free memory was 16.9 MB in the beginning and 29.8 MB in the end (delta: -12.9 MB). Peak memory consumption was 19.1 MB. Max. memory is 14.3 GB. [2020-10-20 05:51:27,165 INFO L168 Benchmark]: Witness Printer took 3.33 ms. Allocated memory is still 80.2 MB. Free memory was 29.8 MB in the beginning and 28.9 MB in the end (delta: 839.3 kB). Peak memory consumption was 839.3 kB. Max. memory is 14.3 GB. [2020-10-20 05:51:27,169 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 33.0 MB. Free memory was 18.0 MB in the beginning and 18.0 MB in the end (delta: 42.0 kB). Peak memory consumption was 42.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 679.02 ms. Allocated memory was 34.6 MB in the beginning and 46.1 MB in the end (delta: 11.5 MB). Free memory was 10.2 MB in the beginning and 22.2 MB in the end (delta: -12.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 72.06 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 19.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 736.64 ms. Allocated memory was 46.1 MB in the beginning and 48.2 MB in the end (delta: 2.1 MB). Free memory was 19.0 MB in the beginning and 17.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. * TraceAbstraction took 8409.81 ms. Allocated memory was 48.2 MB in the beginning and 80.2 MB in the end (delta: 32.0 MB). Free memory was 16.9 MB in the beginning and 29.8 MB in the end (delta: -12.9 MB). Peak memory consumption was 19.1 MB. Max. memory is 14.3 GB. * Witness Printer took 3.33 ms. Allocated memory is still 80.2 MB. Free memory was 29.8 MB in the beginning and 28.9 MB in the end (delta: 839.3 kB). Peak memory consumption was 839.3 kB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L534] int length = __VERIFIER_nondet_int(); [L535] int n = __VERIFIER_nondet_int(); [L536] COND FALSE !(length < 1) [L539] COND FALSE !(n < 1) [L542] char* nondetString1 = (char*) __builtin_alloca (n * sizeof(char)); [L543] char* nondetString2 = (char*) __builtin_alloca (length * sizeof(char)); [L545] int i = 0; [L545] COND FALSE !(i < length - 1) [L550] int i = 0; [L550] COND TRUE i < n - 1 [L552] nondetString1[i] = __VERIFIER_nondet_char() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 80 locations, 17 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 8.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 391 SDtfs, 547 SDslu, 872 SDs, 0 SdLazy, 386 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 108 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 156 ConstructedInterpolants, 4 QuantifiedInterpolants, 7754 SizeOfPredicates, 30 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...