./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-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/memsafety/test-0232-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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/memsafety/test-0232-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 aeec7a18a8140b87b664dd42e07dd87d1c028ac9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54:26,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:54:26,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:54:26,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:54:26,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:54:26,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:54:26,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:54:26,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:54:26,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:54:26,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:54:26,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:54:26,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:54:26,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:54:26,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:54:26,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:54:26,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:54:26,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:54:26,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:54:26,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:54:26,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:54:26,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:54:26,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:54:26,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:54:26,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:54:26,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:54:26,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:54:26,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:54:26,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:54:26,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:54:26,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:54:26,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:54:26,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:54:26,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:54:26,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:54:26,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:54:26,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:54:26,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:54:26,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:54:26,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:54:26,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:54:26,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:54:26,289 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:54:26,312 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:54:26,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:54:26,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:54:26,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:54:26,314 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:54:26,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:54:26,315 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:54:26,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:54:26,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:54:26,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:54:26,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:54:26,316 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:54:26,316 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:54:26,317 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:54:26,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:54:26,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:54:26,317 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:54:26,318 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:54:26,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:54:26,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:54:26,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:54:26,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:54:26,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:54:26,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:54:26,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:54:26,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 05:54:26,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 05:54:26,321 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:54:26,322 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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2020-10-20 05:54:26,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:54:26,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:54:26,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:54:26,547 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:54:26,547 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:54:26,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2020-10-20 05:54:26,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f13938d3/a4db44148f8a4512a83e95d75928fd97/FLAG08e624466 [2020-10-20 05:54:27,149 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:54:27,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2020-10-20 05:54:27,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f13938d3/a4db44148f8a4512a83e95d75928fd97/FLAG08e624466 [2020-10-20 05:54:27,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f13938d3/a4db44148f8a4512a83e95d75928fd97 [2020-10-20 05:54:27,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:54:27,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:54:27,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:54:27,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:54:27,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:54:27,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:54:27" (1/1) ... [2020-10-20 05:54:27,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6961f796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:27, skipping insertion in model container [2020-10-20 05:54:27,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:54:27" (1/1) ... [2020-10-20 05:54:27,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:54:27,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:54:27,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:54:28,013 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:54:28,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:54:28,167 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:54:28,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28 WrapperNode [2020-10-20 05:54:28,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:54:28,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:54:28,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:54:28,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:54:28,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (1/1) ... [2020-10-20 05:54:28,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (1/1) ... [2020-10-20 05:54:28,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (1/1) ... [2020-10-20 05:54:28,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (1/1) ... [2020-10-20 05:54:28,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (1/1) ... [2020-10-20 05:54:28,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (1/1) ... [2020-10-20 05:54:28,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (1/1) ... [2020-10-20 05:54:28,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:54:28,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:54:28,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:54:28,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:54:28,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (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:54:28,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:54:28,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:54:28,362 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 05:54:28,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:54:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:54:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:54:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:54:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:54:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-10-20 05:54:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:54:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:54:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 05:54:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 05:54:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 05:54:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 05:54:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:54:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:54:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:54:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:54:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:54:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:54:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:54:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:54:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:54:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:54:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:54:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:54:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:54:28,370 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:54:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:54:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:54:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:54:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:54:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:54:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:54:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:54:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:54:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:54:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:54:28,373 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:54:28,373 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:54:28,373 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:54:28,373 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:54:28,374 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:54:28,374 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:54:28,374 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:54:28,374 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:54:28,374 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:54:28,375 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:54:28,375 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:54:28,375 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:54:28,375 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:54:28,377 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:54:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:54:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:54:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:54:28,378 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:54:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:54:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:54:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:54:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:54:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:54:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:54:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:54:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:54:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:54:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:54:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:54:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:54:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:54:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:54:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:54:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:54:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:54:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:54:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:54:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:54:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:54:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:54:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:54:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:54:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:54:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:54:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:54:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:54:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:54:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:54:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:54:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:54:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:54:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:54:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:54:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:54:28,396 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:54:28,396 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:54:28,396 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:54:28,396 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:54:28,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:54:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:54:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:54:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:54:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:54:28,404 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:54:28,404 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:54:28,404 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:54:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:54:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:54:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:54:28,405 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:54:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:54:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:54:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:54:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:54:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:54:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:54:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:54:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:54:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 05:54:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-10-20 05:54:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 05:54:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 05:54:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 05:54:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:54:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-20 05:54:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:54:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:54:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 05:54:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:54:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 05:54:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 05:54:29,059 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:54:29,060 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-20 05:54:29,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:29 BoogieIcfgContainer [2020-10-20 05:54:29,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:54:29,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:54:29,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:54:29,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:54:29,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:54:27" (1/3) ... [2020-10-20 05:54:29,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:54:29, skipping insertion in model container [2020-10-20 05:54:29,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:28" (2/3) ... [2020-10-20 05:54:29,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:54:29, skipping insertion in model container [2020-10-20 05:54:29,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:29" (3/3) ... [2020-10-20 05:54:29,072 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2020-10-20 05:54:29,097 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:54:29,108 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. [2020-10-20 05:54:29,119 INFO L253 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2020-10-20 05:54:29,139 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:54:29,140 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:54:29,140 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:54:29,140 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:54:29,140 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:54:29,140 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:54:29,140 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:54:29,140 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:54:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-10-20 05:54:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 05:54:29,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:29,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:29,172 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1751684042, now seen corresponding path program 1 times [2020-10-20 05:54:29,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:29,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464303626] [2020-10-20 05:54:29,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:29,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:29,401 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:54:29,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464303626] [2020-10-20 05:54:29,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:29,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 05:54:29,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208723300] [2020-10-20 05:54:29,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 05:54:29,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 05:54:29,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:54:29,433 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2020-10-20 05:54:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:29,685 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2020-10-20 05:54:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 05:54:29,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-20 05:54:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:29,698 INFO L225 Difference]: With dead ends: 89 [2020-10-20 05:54:29,698 INFO L226 Difference]: Without dead ends: 86 [2020-10-20 05:54:29,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:54:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-20 05:54:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-20 05:54:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-20 05:54:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2020-10-20 05:54:29,744 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 8 [2020-10-20 05:54:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:29,744 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2020-10-20 05:54:29,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 05:54:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-10-20 05:54:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:54:29,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:29,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:29,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 05:54:29,746 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:29,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1532266366, now seen corresponding path program 1 times [2020-10-20 05:54:29,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:29,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285894550] [2020-10-20 05:54:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:29,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:29,890 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:54:29,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285894550] [2020-10-20 05:54:29,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:29,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:54:29,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333807782] [2020-10-20 05:54:29,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:54:29,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:29,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:54:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:54:29,894 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 6 states. [2020-10-20 05:54:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:30,186 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2020-10-20 05:54:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:54:30,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 05:54:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:30,189 INFO L225 Difference]: With dead ends: 78 [2020-10-20 05:54:30,189 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 05:54:30,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 05:54:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-20 05:54:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 05:54:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-10-20 05:54:30,199 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 9 [2020-10-20 05:54:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:30,200 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-10-20 05:54:30,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:54:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-10-20 05:54:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:54:30,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:30,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:30,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 05:54:30,202 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:30,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1532266365, now seen corresponding path program 1 times [2020-10-20 05:54:30,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:30,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804973835] [2020-10-20 05:54:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:30,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:30,314 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:54:30,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804973835] [2020-10-20 05:54:30,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:30,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:54:30,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011214055] [2020-10-20 05:54:30,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:54:30,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:54:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:54:30,317 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2020-10-20 05:54:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:30,649 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2020-10-20 05:54:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:30,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 05:54:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:30,654 INFO L225 Difference]: With dead ends: 96 [2020-10-20 05:54:30,654 INFO L226 Difference]: Without dead ends: 96 [2020-10-20 05:54:30,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-20 05:54:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2020-10-20 05:54:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-20 05:54:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2020-10-20 05:54:30,664 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 9 [2020-10-20 05:54:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:30,665 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2020-10-20 05:54:30,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:54:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2020-10-20 05:54:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:54:30,666 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:30,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:30,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 05:54:30,667 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:30,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash -255617013, now seen corresponding path program 1 times [2020-10-20 05:54:30,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:30,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052286916] [2020-10-20 05:54:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:30,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:30,721 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:54:30,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052286916] [2020-10-20 05:54:30,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:30,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 05:54:30,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742209829] [2020-10-20 05:54:30,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:54:30,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:30,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:54:30,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:54:30,724 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2020-10-20 05:54:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:30,865 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-10-20 05:54:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 05:54:30,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 05:54:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:30,867 INFO L225 Difference]: With dead ends: 79 [2020-10-20 05:54:30,867 INFO L226 Difference]: Without dead ends: 79 [2020-10-20 05:54:30,868 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:54:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-20 05:54:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-20 05:54:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-20 05:54:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-10-20 05:54:30,875 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 10 [2020-10-20 05:54:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:30,875 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-10-20 05:54:30,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:54:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-10-20 05:54:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:54:30,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:30,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:30,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 05:54:30,877 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash -255617012, now seen corresponding path program 1 times [2020-10-20 05:54:30,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:30,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782222404] [2020-10-20 05:54:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:30,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:30,941 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:54:30,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782222404] [2020-10-20 05:54:30,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:30,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 05:54:30,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60075891] [2020-10-20 05:54:30,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:54:30,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:30,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:54:30,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:54:30,945 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 4 states. [2020-10-20 05:54:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:31,069 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2020-10-20 05:54:31,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 05:54:31,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 05:54:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:31,071 INFO L225 Difference]: With dead ends: 75 [2020-10-20 05:54:31,071 INFO L226 Difference]: Without dead ends: 75 [2020-10-20 05:54:31,071 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:54:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-20 05:54:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-10-20 05:54:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-20 05:54:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2020-10-20 05:54:31,078 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 10 [2020-10-20 05:54:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:31,078 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2020-10-20 05:54:31,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:54:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-10-20 05:54:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 05:54:31,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:31,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:31,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 05:54:31,080 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:31,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:31,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1995559187, now seen corresponding path program 1 times [2020-10-20 05:54:31,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:31,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321238166] [2020-10-20 05:54:31,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:31,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:31,204 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:54:31,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321238166] [2020-10-20 05:54:31,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:31,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 05:54:31,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22243628] [2020-10-20 05:54:31,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:54:31,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:54:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:54:31,208 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2020-10-20 05:54:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:31,558 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2020-10-20 05:54:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 05:54:31,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-20 05:54:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:31,560 INFO L225 Difference]: With dead ends: 86 [2020-10-20 05:54:31,561 INFO L226 Difference]: Without dead ends: 86 [2020-10-20 05:54:31,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:54:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-20 05:54:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2020-10-20 05:54:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-20 05:54:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2020-10-20 05:54:31,581 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 15 [2020-10-20 05:54:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:31,584 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2020-10-20 05:54:31,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:54:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2020-10-20 05:54:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 05:54:31,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:31,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:31,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 05:54:31,586 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:31,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1732514512, now seen corresponding path program 1 times [2020-10-20 05:54:31,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:31,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804509309] [2020-10-20 05:54:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:31,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:31,727 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:54:31,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804509309] [2020-10-20 05:54:31,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:31,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:54:31,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836386769] [2020-10-20 05:54:31,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:31,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:31,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:31,731 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 8 states. [2020-10-20 05:54:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:31,928 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2020-10-20 05:54:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:31,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-20 05:54:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:31,930 INFO L225 Difference]: With dead ends: 81 [2020-10-20 05:54:31,930 INFO L226 Difference]: Without dead ends: 81 [2020-10-20 05:54:31,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:54:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-20 05:54:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2020-10-20 05:54:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 05:54:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2020-10-20 05:54:31,937 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2020-10-20 05:54:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:31,938 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2020-10-20 05:54:31,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2020-10-20 05:54:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 05:54:31,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:31,939 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] [2020-10-20 05:54:31,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 05:54:31,940 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1337248604, now seen corresponding path program 1 times [2020-10-20 05:54:31,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:31,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556035] [2020-10-20 05:54:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:31,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:32,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:32,073 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:54:32,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556035] [2020-10-20 05:54:32,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:32,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:54:32,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706506760] [2020-10-20 05:54:32,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:54:32,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:54:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:54:32,076 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 9 states. [2020-10-20 05:54:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:32,391 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2020-10-20 05:54:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:32,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-20 05:54:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:32,393 INFO L225 Difference]: With dead ends: 86 [2020-10-20 05:54:32,393 INFO L226 Difference]: Without dead ends: 86 [2020-10-20 05:54:32,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 05:54:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-20 05:54:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2020-10-20 05:54:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 05:54:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2020-10-20 05:54:32,398 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 24 [2020-10-20 05:54:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:32,400 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2020-10-20 05:54:32,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:54:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2020-10-20 05:54:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 05:54:32,401 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:32,401 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] [2020-10-20 05:54:32,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 05:54:32,402 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1337248605, now seen corresponding path program 1 times [2020-10-20 05:54:32,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:32,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6690448] [2020-10-20 05:54:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:32,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:32,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:32,555 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:54:32,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6690448] [2020-10-20 05:54:32,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:32,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:54:32,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025382388] [2020-10-20 05:54:32,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:54:32,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:54:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:54:32,558 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 9 states. [2020-10-20 05:54:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:32,917 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-10-20 05:54:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:32,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-20 05:54:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:32,918 INFO L225 Difference]: With dead ends: 88 [2020-10-20 05:54:32,918 INFO L226 Difference]: Without dead ends: 88 [2020-10-20 05:54:32,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 05:54:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-20 05:54:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2020-10-20 05:54:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 05:54:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-10-20 05:54:32,925 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2020-10-20 05:54:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:32,925 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-10-20 05:54:32,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:54:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-10-20 05:54:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 05:54:32,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:32,927 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] [2020-10-20 05:54:32,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 05:54:32,936 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash 920853620, now seen corresponding path program 1 times [2020-10-20 05:54:32,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:32,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038203823] [2020-10-20 05:54:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:32,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,082 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:54:33,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038203823] [2020-10-20 05:54:33,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:33,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:54:33,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692658064] [2020-10-20 05:54:33,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:33,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:33,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:33,086 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 8 states. [2020-10-20 05:54:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:33,356 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-10-20 05:54:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:33,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-20 05:54:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:33,358 INFO L225 Difference]: With dead ends: 70 [2020-10-20 05:54:33,358 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 05:54:33,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 05:54:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-20 05:54:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 05:54:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-10-20 05:54:33,371 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2020-10-20 05:54:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:33,371 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-10-20 05:54:33,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-10-20 05:54:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 05:54:33,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:33,373 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] [2020-10-20 05:54:33,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 05:54:33,373 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:33,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2143461996, now seen corresponding path program 1 times [2020-10-20 05:54:33,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:33,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38361585] [2020-10-20 05:54:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,470 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:54:33,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38361585] [2020-10-20 05:54:33,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:33,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:54:33,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660363055] [2020-10-20 05:54:33,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:33,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:33,472 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2020-10-20 05:54:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:33,714 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-10-20 05:54:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:33,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-20 05:54:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:33,716 INFO L225 Difference]: With dead ends: 69 [2020-10-20 05:54:33,716 INFO L226 Difference]: Without dead ends: 69 [2020-10-20 05:54:33,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-20 05:54:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-20 05:54:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 05:54:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-10-20 05:54:33,720 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 27 [2020-10-20 05:54:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:33,720 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-10-20 05:54:33,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-10-20 05:54:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 05:54:33,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:33,722 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] [2020-10-20 05:54:33,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 05:54:33,722 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:33,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2022812355, now seen corresponding path program 1 times [2020-10-20 05:54:33,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:33,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429903563] [2020-10-20 05:54:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,857 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:54:33,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429903563] [2020-10-20 05:54:33,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:33,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 05:54:33,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141429306] [2020-10-20 05:54:33,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:33,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:33,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:33,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:33,865 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2020-10-20 05:54:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:34,158 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-10-20 05:54:34,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:34,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-20 05:54:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:34,159 INFO L225 Difference]: With dead ends: 68 [2020-10-20 05:54:34,159 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 05:54:34,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 05:54:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-20 05:54:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-20 05:54:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-10-20 05:54:34,167 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 28 [2020-10-20 05:54:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:34,171 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-10-20 05:54:34,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-10-20 05:54:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:54:34,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:34,173 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] [2020-10-20 05:54:34,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 05:54:34,173 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -700341473, now seen corresponding path program 1 times [2020-10-20 05:54:34,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:34,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273110568] [2020-10-20 05:54:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:34,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:34,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:34,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273110568] [2020-10-20 05:54:34,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329805956] [2020-10-20 05:54:34,363 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:54:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:34,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2020-10-20 05:54:34,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:34,630 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:34,630 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:34,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:34,640 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:34,640 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 05:54:34,711 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:34,711 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-10-20 05:54:34,712 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:34,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:34,718 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:34,718 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:10 [2020-10-20 05:54:34,784 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:54:34,785 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:34,792 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:34,796 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 1 xjuncts. [2020-10-20 05:54:34,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2020-10-20 05:54:34,965 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:34,966 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 44 [2020-10-20 05:54:34,967 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:34,989 INFO L625 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2020-10-20 05:54:34,991 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:54:34,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2020-10-20 05:54:35,116 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:54:35,138 INFO L350 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2020-10-20 05:54:35,139 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2020-10-20 05:54:35,140 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:35,162 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2020-10-20 05:54:35,165 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:35,166 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2020-10-20 05:54:35,244 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:35,245 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 28 treesize of output 24 [2020-10-20 05:54:35,245 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:35,253 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:35,255 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:35,256 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2020-10-20 05:54:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:35,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:54:35,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2020-10-20 05:54:35,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040595440] [2020-10-20 05:54:35,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-20 05:54:35,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-20 05:54:35,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2020-10-20 05:54:35,275 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 23 states. [2020-10-20 05:54:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:36,374 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2020-10-20 05:54:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-20 05:54:36,375 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2020-10-20 05:54:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:36,376 INFO L225 Difference]: With dead ends: 74 [2020-10-20 05:54:36,376 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 05:54:36,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2020-10-20 05:54:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 05:54:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-10-20 05:54:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 05:54:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2020-10-20 05:54:36,380 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 29 [2020-10-20 05:54:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:36,380 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2020-10-20 05:54:36,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-20 05:54:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2020-10-20 05:54:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:54:36,381 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:36,382 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] [2020-10-20 05:54:36,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-20 05:54:36,593 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:36,594 INFO L82 PathProgramCache]: Analyzing trace with hash -700341472, now seen corresponding path program 1 times [2020-10-20 05:54:36,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:36,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769814334] [2020-10-20 05:54:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:36,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:36,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:36,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769814334] [2020-10-20 05:54:36,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160572283] [2020-10-20 05:54:36,833 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:54:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:36,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 59 conjunts are in the unsatisfiable core [2020-10-20 05:54:36,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:36,997 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:36,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,010 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,011 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-10-20 05:54:37,075 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,076 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-10-20 05:54:37,080 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,089 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,089 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2020-10-20 05:54:37,179 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:54:37,179 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,202 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:54:37,202 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,220 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:37,220 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:45 [2020-10-20 05:54:37,437 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,438 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2020-10-20 05:54:37,438 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,469 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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 24 [2020-10-20 05:54:37,470 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,489 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:37,489 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:52 [2020-10-20 05:54:37,631 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:54:37,643 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:54:37,643 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 30 [2020-10-20 05:54:37,644 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,667 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,672 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 05:54:37,686 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:54:37,686 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 32 [2020-10-20 05:54:37,687 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:37,716 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:82, output treesize:71 [2020-10-20 05:54:37,856 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,857 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 42 treesize of output 34 [2020-10-20 05:54:37,858 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,883 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,883 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2020-10-20 05:54:37,884 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:37,896 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:37,899 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:37,899 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:85, output treesize:23 [2020-10-20 05:54:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:37,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:54:37,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2020-10-20 05:54:37,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937349809] [2020-10-20 05:54:37,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-20 05:54:37,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:37,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-20 05:54:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2020-10-20 05:54:37,963 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 23 states. [2020-10-20 05:54:38,913 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2020-10-20 05:54:39,128 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2020-10-20 05:54:39,272 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-10-20 05:54:39,498 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2020-10-20 05:54:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:40,091 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-10-20 05:54:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 05:54:40,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2020-10-20 05:54:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:40,094 INFO L225 Difference]: With dead ends: 73 [2020-10-20 05:54:40,094 INFO L226 Difference]: Without dead ends: 73 [2020-10-20 05:54:40,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2020-10-20 05:54:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-20 05:54:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-10-20 05:54:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 05:54:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-10-20 05:54:40,099 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 29 [2020-10-20 05:54:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:40,099 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-10-20 05:54:40,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-20 05:54:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-10-20 05:54:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 05:54:40,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:40,100 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:54:40,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-20 05:54:40,312 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1717326518, now seen corresponding path program 1 times [2020-10-20 05:54:40,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:40,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632762908] [2020-10-20 05:54:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:40,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:40,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:40,415 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:54:40,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632762908] [2020-10-20 05:54:40,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:40,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:54:40,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123491684] [2020-10-20 05:54:40,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:54:40,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:40,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:54:40,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:54:40,417 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 9 states. [2020-10-20 05:54:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:40,680 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-10-20 05:54:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:40,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-20 05:54:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:40,681 INFO L225 Difference]: With dead ends: 70 [2020-10-20 05:54:40,682 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 05:54:40,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-20 05:54:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 05:54:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-20 05:54:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 05:54:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-10-20 05:54:40,687 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 29 [2020-10-20 05:54:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:40,687 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-10-20 05:54:40,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:54:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-10-20 05:54:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 05:54:40,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:40,688 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:54:40,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 05:54:40,688 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1697514592, now seen corresponding path program 1 times [2020-10-20 05:54:40,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:40,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370722602] [2020-10-20 05:54:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:40,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:40,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:40,827 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:54:40,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370722602] [2020-10-20 05:54:40,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:40,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:54:40,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181163002] [2020-10-20 05:54:40,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:54:40,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:54:40,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:54:40,829 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 9 states. [2020-10-20 05:54:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:41,087 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-10-20 05:54:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:41,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-20 05:54:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:41,089 INFO L225 Difference]: With dead ends: 69 [2020-10-20 05:54:41,089 INFO L226 Difference]: Without dead ends: 69 [2020-10-20 05:54:41,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-20 05:54:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-20 05:54:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 05:54:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-10-20 05:54:41,092 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2020-10-20 05:54:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:41,093 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-10-20 05:54:41,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:54:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2020-10-20 05:54:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 05:54:41,093 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:41,094 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:54:41,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 05:54:41,094 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:41,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:41,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1697514593, now seen corresponding path program 1 times [2020-10-20 05:54:41,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:41,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155984419] [2020-10-20 05:54:41,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:41,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:41,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:41,185 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:54:41,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155984419] [2020-10-20 05:54:41,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:41,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:54:41,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148818755] [2020-10-20 05:54:41,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:54:41,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:54:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:54:41,187 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 6 states. [2020-10-20 05:54:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:41,343 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2020-10-20 05:54:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:54:41,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-10-20 05:54:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:41,345 INFO L225 Difference]: With dead ends: 64 [2020-10-20 05:54:41,345 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 05:54:41,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:54:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 05:54:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-20 05:54:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 05:54:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-10-20 05:54:41,349 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2020-10-20 05:54:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:41,349 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-10-20 05:54:41,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:54:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-10-20 05:54:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-20 05:54:41,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:41,350 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, 1, 1, 1, 1] [2020-10-20 05:54:41,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 05:54:41,350 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:41,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1541696294, now seen corresponding path program 1 times [2020-10-20 05:54:41,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:41,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095626556] [2020-10-20 05:54:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:54:41,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:54:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:54:41,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:54:41,434 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 05:54:41,435 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 05:54:41,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 05:54:41,456 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-10-20 05:54:41,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:54:41 BoogieIcfgContainer [2020-10-20 05:54:41,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 05:54:41,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 05:54:41,476 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 05:54:41,476 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 05:54:41,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:29" (3/4) ... [2020-10-20 05:54:41,480 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 05:54:41,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 05:54:41,482 INFO L168 Benchmark]: Toolchain (without parser) took 13983.69 ms. Allocated memory was 35.7 MB in the beginning and 105.4 MB in the end (delta: 69.7 MB). Free memory was 13.7 MB in the beginning and 35.9 MB in the end (delta: -22.2 MB). Peak memory consumption was 47.6 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:41,482 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 33.6 MB. Free memory was 9.5 MB in the beginning and 9.4 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 05:54:41,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.86 ms. Allocated memory was 35.7 MB in the beginning and 46.1 MB in the end (delta: 10.5 MB). Free memory was 12.8 MB in the beginning and 24.9 MB in the end (delta: -12.1 MB). Peak memory consumption was 12.2 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:41,483 INFO L168 Benchmark]: Boogie Preprocessor took 121.55 ms. Allocated memory is still 46.1 MB. Free memory was 24.9 MB in the beginning and 22.0 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:54:41,484 INFO L168 Benchmark]: RCFGBuilder took 772.02 ms. Allocated memory was 46.1 MB in the beginning and 47.7 MB in the end (delta: 1.6 MB). Free memory was 22.0 MB in the beginning and 11.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:41,485 INFO L168 Benchmark]: TraceAbstraction took 12411.40 ms. Allocated memory was 47.7 MB in the beginning and 105.4 MB in the end (delta: 57.7 MB). Free memory was 11.4 MB in the beginning and 37.4 MB in the end (delta: -26.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:41,485 INFO L168 Benchmark]: Witness Printer took 5.03 ms. Allocated memory is still 105.4 MB. Free memory was 37.4 MB in the beginning and 35.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:41,488 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.26 ms. Allocated memory is still 33.6 MB. Free memory was 9.5 MB in the beginning and 9.4 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 664.86 ms. Allocated memory was 35.7 MB in the beginning and 46.1 MB in the end (delta: 10.5 MB). Free memory was 12.8 MB in the beginning and 24.9 MB in the end (delta: -12.1 MB). Peak memory consumption was 12.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 121.55 ms. Allocated memory is still 46.1 MB. Free memory was 24.9 MB in the beginning and 22.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 772.02 ms. Allocated memory was 46.1 MB in the beginning and 47.7 MB in the end (delta: 1.6 MB). Free memory was 22.0 MB in the beginning and 11.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 14.3 GB. * TraceAbstraction took 12411.40 ms. Allocated memory was 47.7 MB in the beginning and 105.4 MB in the end (delta: 57.7 MB). Free memory was 11.4 MB in the beginning and 37.4 MB in the end (delta: -26.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 14.3 GB. * Witness Printer took 5.03 ms. Allocated memory is still 105.4 MB. Free memory was 37.4 MB in the beginning and 35.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={3:0}] [L541] CALL append(&list) VAL [plist={3:0}] [L530] struct item *item = malloc(sizeof *item); VAL [item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L532] EXPR item->next VAL [item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={1:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L535] *plist = item VAL [item={1:0}, malloc(sizeof *item)={-1:0}, malloc(sizeof *item)={1:0}, plist={3:0}, plist={3:0}] [L541] RET append(&list) VAL [list={3:0}] [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={1:0}, list={3:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={1:0}, list={3:0}] [L544] EXPR list->next VAL [\read(*list)={1:0}, list={3:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={1:0}, list={3:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={3:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={3:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 109 locations, 42 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.2s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 786 SDtfs, 816 SDslu, 2390 SDs, 0 SdLazy, 4068 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 392 ConstructedInterpolants, 25 QuantifiedInterpolants, 106615 SizeOfPredicates, 41 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 6/28 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... ### Bit-precise run ### This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 05:54:43,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:54:43,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:54:43,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:54:43,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:54:43,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:54:43,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:54:43,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:54:43,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:54:43,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:54:43,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:54:43,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:54:43,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:54:43,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:54:43,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:54:43,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:54:43,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:54:43,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:54:43,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:54:43,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:54:43,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:54:43,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:54:43,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:54:43,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:54:43,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:54:43,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:54:43,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:54:43,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:54:43,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:54:43,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:54:43,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:54:43,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:54:43,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:54:43,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:54:43,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:54:43,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:54:43,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:54:43,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:54:43,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:54:43,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:54:43,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:54:43,882 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:54:43,907 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:54:43,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:54:43,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:54:43,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:54:43,909 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:54:43,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:54:43,909 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:54:43,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:54:43,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:54:43,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:54:43,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:54:43,910 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:54:43,911 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:54:43,911 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:54:43,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:54:43,911 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:54:43,912 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 05:54:43,912 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 05:54:43,912 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:54:43,912 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:54:43,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:54:43,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:54:43,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:54:43,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:54:43,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:54:43,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:54:43,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:54:43,915 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 05:54:43,915 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 05:54:43,915 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:54:43,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 05:54:43,916 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 -> aeec7a18a8140b87b664dd42e07dd87d1c028ac9 [2020-10-20 05:54:44,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:54:44,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:54:44,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:54:44,200 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:54:44,201 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:54:44,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2020-10-20 05:54:44,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e028f115d/68b676c57f884b8da4c63701a59b7597/FLAG693a6e948 [2020-10-20 05:54:44,734 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:54:44,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2020-10-20 05:54:44,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e028f115d/68b676c57f884b8da4c63701a59b7597/FLAG693a6e948 [2020-10-20 05:54:45,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e028f115d/68b676c57f884b8da4c63701a59b7597 [2020-10-20 05:54:45,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:54:45,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:54:45,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:54:45,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:54:45,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:54:45,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433b967f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45, skipping insertion in model container [2020-10-20 05:54:45,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:54:45,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:54:45,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:54:45,633 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:54:45,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:54:45,792 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:54:45,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45 WrapperNode [2020-10-20 05:54:45,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:54:45,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:54:45,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:54:45,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:54:45,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (1/1) ... [2020-10-20 05:54:45,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:54:45,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:54:45,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:54:45,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:54:45,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (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:54:45,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:54:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:54:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:54:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 05:54:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:54:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:54:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:54:45,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:54:45,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:54:45,941 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2020-10-20 05:54:45,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:54:45,942 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:54:45,942 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 05:54:45,942 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 05:54:45,943 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 05:54:45,943 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 05:54:45,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:54:45,943 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:54:45,943 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:54:45,943 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:54:45,944 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:54:45,944 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:54:45,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:54:45,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:54:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:54:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:54:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:54:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:54:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:54:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:54:45,946 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:54:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:54:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:54:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:54:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:54:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:54:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:54:45,947 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:54:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:54:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:54:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:54:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:54:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:54:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:54:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:54:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:54:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:54:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:54:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:54:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:54:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:54:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:54:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:54:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:54:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:54:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:54:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:54:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:54:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:54:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:54:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:54:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:54:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:54:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:54:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:54:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:54:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:54:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:54:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:54:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:54:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:54:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:54:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:54:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:54:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:54:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:54:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:54:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:54:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:54:45,964 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:54:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:54:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:54:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:54:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:54:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:54:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:54:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:54:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:54:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:54:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:54:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:54:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:54:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:54:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:54:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:54:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:54:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:54:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:54:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:54:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:54:45,970 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:54:45,970 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:54:45,970 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:54:45,970 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:54:45,970 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:54:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:54:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:54:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:54:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:54:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 05:54:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure append [2020-10-20 05:54:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 05:54:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 05:54:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 05:54:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:54:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-20 05:54:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:54:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:54:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 05:54:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:54:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:54:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-10-20 05:54:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-10-20 05:54:46,767 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:54:46,767 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-20 05:54:46,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:46 BoogieIcfgContainer [2020-10-20 05:54:46,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:54:46,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:54:46,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:54:46,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:54:46,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:54:45" (1/3) ... [2020-10-20 05:54:46,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23425c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:54:46, skipping insertion in model container [2020-10-20 05:54:46,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:45" (2/3) ... [2020-10-20 05:54:46,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23425c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:54:46, skipping insertion in model container [2020-10-20 05:54:46,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:46" (3/3) ... [2020-10-20 05:54:46,778 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2020-10-20 05:54:46,789 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:54:46,797 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. [2020-10-20 05:54:46,811 INFO L253 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2020-10-20 05:54:46,830 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:54:46,830 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:54:46,830 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:54:46,830 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:54:46,830 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:54:46,830 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:54:46,831 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:54:46,831 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:54:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-10-20 05:54:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 05:54:46,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:46,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:46,860 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1603877397, now seen corresponding path program 1 times [2020-10-20 05:54:46,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:46,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212173144] [2020-10-20 05:54:46,881 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:54:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:47,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-20 05:54:47,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:47,112 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:54:47,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:47,129 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:54:47,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212173144] [2020-10-20 05:54:47,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:47,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 05:54:47,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956648490] [2020-10-20 05:54:47,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 05:54:47,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 05:54:47,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 05:54:47,157 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2020-10-20 05:54:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:47,180 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2020-10-20 05:54:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 05:54:47,181 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-10-20 05:54:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:47,192 INFO L225 Difference]: With dead ends: 88 [2020-10-20 05:54:47,192 INFO L226 Difference]: Without dead ends: 85 [2020-10-20 05:54:47,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 05:54:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-20 05:54:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-10-20 05:54:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-20 05:54:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2020-10-20 05:54:47,240 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 8 [2020-10-20 05:54:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:47,240 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2020-10-20 05:54:47,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 05:54:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2020-10-20 05:54:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:54:47,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:47,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:47,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 05:54:47,455 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:47,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1819511446, now seen corresponding path program 1 times [2020-10-20 05:54:47,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:47,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201064878] [2020-10-20 05:54:47,458 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:54:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:47,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 05:54:47,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:47,692 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:47,692 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:47,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:47,696 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:47,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 05:54:47,764 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:47,765 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-10-20 05:54:47,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 05:54:47,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 05:54:47,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201064878] [2020-10-20 05:54:47,774 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 1) [2020-10-20 05:54:47,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1830031893] [2020-10-20 05:54:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 05:54:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:48,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 05:54:48,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:48,032 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:48,032 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:48,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:48,041 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:48,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 05:54:48,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:54:48,097 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-10-20 05:54:48,099 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:48,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:48,116 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:48,117 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2020-10-20 05:54:48,159 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:54:48,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:48,236 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:54:48,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:48,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-20 05:54:48,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926127969] [2020-10-20 05:54:48,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:48,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:54:48,239 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 8 states. [2020-10-20 05:54:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:48,902 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2020-10-20 05:54:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:54:48,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-10-20 05:54:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:48,905 INFO L225 Difference]: With dead ends: 98 [2020-10-20 05:54:48,905 INFO L226 Difference]: Without dead ends: 98 [2020-10-20 05:54:48,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:54:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-20 05:54:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2020-10-20 05:54:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-20 05:54:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2020-10-20 05:54:48,916 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 9 [2020-10-20 05:54:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:48,917 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2020-10-20 05:54:48,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-10-20 05:54:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:54:48,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:48,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:49,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,3 mathsat -unsat_core_generation=3 [2020-10-20 05:54:49,322 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1819511447, now seen corresponding path program 1 times [2020-10-20 05:54:49,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:49,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40417096] [2020-10-20 05:54:49,325 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:54:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:49,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 05:54:49,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:49,479 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:49,480 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:49,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:49,492 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:49,492 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:49,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:49,501 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:49,501 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-10-20 05:54:49,582 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:49,582 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2020-10-20 05:54:49,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40417096] [2020-10-20 05:54:49,584 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 1) [2020-10-20 05:54:49,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1634904006] [2020-10-20 05:54:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 05:54:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:49,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 05:54:49,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:49,820 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:49,821 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:49,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:49,835 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:49,835 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 05:54:49,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:54:49,915 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-10-20 05:54:49,917 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:49,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:49,937 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:49,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2020-10-20 05:54:49,975 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:54:49,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:50,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:50,294 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:54:50,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:50,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-20 05:54:50,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288345656] [2020-10-20 05:54:50,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:50,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:54:50,296 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 8 states. [2020-10-20 05:54:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:51,210 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-10-20 05:54:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:54:51,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-10-20 05:54:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:51,219 INFO L225 Difference]: With dead ends: 83 [2020-10-20 05:54:51,219 INFO L226 Difference]: Without dead ends: 83 [2020-10-20 05:54:51,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-20 05:54:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2020-10-20 05:54:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 05:54:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-10-20 05:54:51,229 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 9 [2020-10-20 05:54:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:51,229 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-10-20 05:54:51,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-10-20 05:54:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:54:51,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:51,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:51,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 05:54:51,633 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 570280076, now seen corresponding path program 1 times [2020-10-20 05:54:51,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:51,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467105359] [2020-10-20 05:54:51,635 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:54:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:51,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 05:54:51,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:51,745 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:51,746 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:51,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:51,748 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:51,748 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 05:54:51,752 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:54:51,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:51,768 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:54:51,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467105359] [2020-10-20 05:54:51,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:51,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 05:54:51,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693877762] [2020-10-20 05:54:51,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 05:54:51,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 05:54:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 05:54:51,773 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 3 states. [2020-10-20 05:54:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:51,952 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-10-20 05:54:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 05:54:51,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 05:54:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:51,954 INFO L225 Difference]: With dead ends: 72 [2020-10-20 05:54:51,954 INFO L226 Difference]: Without dead ends: 72 [2020-10-20 05:54:51,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:54:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-20 05:54:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-20 05:54:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 05:54:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2020-10-20 05:54:51,962 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 10 [2020-10-20 05:54:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:51,962 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2020-10-20 05:54:51,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 05:54:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2020-10-20 05:54:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 05:54:51,963 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:51,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:52,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 05:54:52,171 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash 570280077, now seen corresponding path program 1 times [2020-10-20 05:54:52,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:52,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638011750] [2020-10-20 05:54:52,173 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:54:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:52,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 05:54:52,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:52,291 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:54:52,291 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:52,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:52,297 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:52,298 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 05:54:52,307 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:54:52,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:52,368 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:54:52,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638011750] [2020-10-20 05:54:52,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:52,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-20 05:54:52,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718460050] [2020-10-20 05:54:52,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 05:54:52,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:52,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 05:54:52,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:54:52,371 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 4 states. [2020-10-20 05:54:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:52,597 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-10-20 05:54:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 05:54:52,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 05:54:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:52,600 INFO L225 Difference]: With dead ends: 68 [2020-10-20 05:54:52,600 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 05:54:52,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 05:54:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 05:54:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-20 05:54:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-20 05:54:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2020-10-20 05:54:52,606 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 10 [2020-10-20 05:54:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:52,606 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2020-10-20 05:54:52,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 05:54:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-10-20 05:54:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 05:54:52,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:52,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:52,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-20 05:54:52,809 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash -771427871, now seen corresponding path program 1 times [2020-10-20 05:54:52,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:52,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204361657] [2020-10-20 05:54:52,811 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:54:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:52,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 05:54:52,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:53,042 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:54:53,043 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 23 treesize of output 18 [2020-10-20 05:54:53,044 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:53,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:53,080 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:54:53,080 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 23 treesize of output 18 [2020-10-20 05:54:53,081 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:53,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:53,095 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:53,096 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:37 [2020-10-20 05:54:53,174 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:53,174 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 26 treesize of output 22 [2020-10-20 05:54:53,175 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:53,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:53,195 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:53,196 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 26 treesize of output 22 [2020-10-20 05:54:53,196 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:53,208 INFO L625 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2020-10-20 05:54:53,208 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:53,215 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:7 [2020-10-20 05:54:53,238 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:54:53,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:53,307 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:54:53,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204361657] [2020-10-20 05:54:53,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:53,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-10-20 05:54:53,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721578415] [2020-10-20 05:54:53,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 05:54:53,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 05:54:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:54:53,310 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 10 states. [2020-10-20 05:54:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:54,026 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2020-10-20 05:54:54,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:54:54,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-20 05:54:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:54,029 INFO L225 Difference]: With dead ends: 80 [2020-10-20 05:54:54,029 INFO L226 Difference]: Without dead ends: 80 [2020-10-20 05:54:54,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:54:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-20 05:54:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2020-10-20 05:54:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-20 05:54:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2020-10-20 05:54:54,037 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 15 [2020-10-20 05:54:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:54,037 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2020-10-20 05:54:54,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 05:54:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2020-10-20 05:54:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 05:54:54,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:54,039 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:54:54,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-20 05:54:54,251 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash 195740584, now seen corresponding path program 1 times [2020-10-20 05:54:54,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:54,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340613014] [2020-10-20 05:54:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-20 05:54:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:54,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 05:54:54,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:54,432 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:54:54,432 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:54,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:54,453 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:54:54,453 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:54,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:54,464 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:54,465 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-10-20 05:54:54,512 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:54:54,513 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:54,521 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:54,524 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 17 treesize of output 9 [2020-10-20 05:54:54,524 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:54,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:54,532 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:54,532 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-10-20 05:54:54,560 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:54:54,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:54,969 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 36 treesize of output 28 [2020-10-20 05:54:54,971 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-20 05:54:55,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:55,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:54:55,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:54:55,009 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:55,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:54:55,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:54:55,040 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:55,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:55,059 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-20 05:54:55,059 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2020-10-20 05:54:55,128 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-20 05:54:55,148 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 8 treesize of output 6 [2020-10-20 05:54:55,149 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:54:55,166 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 8 treesize of output 6 [2020-10-20 05:54:55,167 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:55,181 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 16 treesize of output 12 [2020-10-20 05:54:55,182 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:55,194 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 8 treesize of output 6 [2020-10-20 05:54:55,195 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:55,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:55,259 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-10-20 05:54:55,260 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2020-10-20 05:54:55,461 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:54:55,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340613014] [2020-10-20 05:54:55,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:55,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-10-20 05:54:55,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44967440] [2020-10-20 05:54:55,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:54:55,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:55,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:54:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:55,468 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 12 states. [2020-10-20 05:54:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:56,399 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2020-10-20 05:54:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:56,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-20 05:54:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:56,401 INFO L225 Difference]: With dead ends: 85 [2020-10-20 05:54:56,401 INFO L226 Difference]: Without dead ends: 85 [2020-10-20 05:54:56,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:54:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-20 05:54:56,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2020-10-20 05:54:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 05:54:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2020-10-20 05:54:56,408 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 23 [2020-10-20 05:54:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:56,409 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2020-10-20 05:54:56,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:54:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-10-20 05:54:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 05:54:56,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:56,410 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:54:56,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-20 05:54:56,622 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:56,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash 195740583, now seen corresponding path program 1 times [2020-10-20 05:54:56,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:56,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419594792] [2020-10-20 05:54:56,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-20 05:54:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:56,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 05:54:56,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:56,780 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:54:56,780 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:56,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:56,786 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:56,786 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-10-20 05:54:56,811 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 19 treesize of output 11 [2020-10-20 05:54:56,811 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:56,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:56,813 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:54:56,813 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-10-20 05:54:56,824 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:54:56,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:56,923 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 32 treesize of output 28 [2020-10-20 05:54:56,924 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:54:56,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:56,948 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:56,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-10-20 05:54:57,029 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:57,040 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:54:57,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419594792] [2020-10-20 05:54:57,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:57,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2020-10-20 05:54:57,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107899336] [2020-10-20 05:54:57,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:57,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:57,042 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 8 states. [2020-10-20 05:54:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:57,459 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2020-10-20 05:54:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:57,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-20 05:54:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:57,461 INFO L225 Difference]: With dead ends: 82 [2020-10-20 05:54:57,461 INFO L226 Difference]: Without dead ends: 82 [2020-10-20 05:54:57,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:54:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-20 05:54:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2020-10-20 05:54:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-20 05:54:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2020-10-20 05:54:57,467 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 23 [2020-10-20 05:54:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:57,467 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2020-10-20 05:54:57,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2020-10-20 05:54:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:54:57,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:57,468 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:54:57,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-20 05:54:57,673 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash -851693409, now seen corresponding path program 1 times [2020-10-20 05:54:57,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:57,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934031141] [2020-10-20 05:54:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-20 05:54:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:57,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 05:54:57,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:57,840 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 11 treesize of output 7 [2020-10-20 05:54:57,840 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:57,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:57,847 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:57,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-10-20 05:54:57,869 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 16 treesize of output 8 [2020-10-20 05:54:57,870 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:57,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:57,872 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:54:57,872 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-10-20 05:54:57,882 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:54:57,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:57,991 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 30 treesize of output 26 [2020-10-20 05:54:57,992 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-20 05:54:58,030 INFO L625 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2020-10-20 05:54:58,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-20 05:54:58,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2020-10-20 05:54:58,041 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:54:58,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934031141] [2020-10-20 05:54:58,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:58,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-10-20 05:54:58,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496465050] [2020-10-20 05:54:58,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:54:58,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:58,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:54:58,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:54:58,043 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2020-10-20 05:54:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:58,338 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-10-20 05:54:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:58,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-20 05:54:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:58,340 INFO L225 Difference]: With dead ends: 67 [2020-10-20 05:54:58,340 INFO L226 Difference]: Without dead ends: 67 [2020-10-20 05:54:58,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-20 05:54:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-20 05:54:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 05:54:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2020-10-20 05:54:58,345 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2020-10-20 05:54:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:58,346 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2020-10-20 05:54:58,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:54:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2020-10-20 05:54:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 05:54:58,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:58,347 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] [2020-10-20 05:54:58,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-20 05:54:58,558 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1257845026, now seen corresponding path program 1 times [2020-10-20 05:54:58,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:58,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558060600] [2020-10-20 05:54:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-20 05:54:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:58,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 05:54:58,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:58,699 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:54:58,699 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:58,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:58,701 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:58,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-20 05:54:58,725 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:54:58,726 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:58,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:58,729 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:54:58,729 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-20 05:54:58,739 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:54:58,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:58,825 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 28 treesize of output 24 [2020-10-20 05:54:58,827 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-20 05:54:58,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:58,836 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-20 05:54:58,836 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2020-10-20 05:54:58,846 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:54:58,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558060600] [2020-10-20 05:54:58,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:58,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-10-20 05:54:58,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174095764] [2020-10-20 05:54:58,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:54:58,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:54:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:54:58,848 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2020-10-20 05:54:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:59,066 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-10-20 05:54:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:59,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-20 05:54:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:59,068 INFO L225 Difference]: With dead ends: 66 [2020-10-20 05:54:59,068 INFO L226 Difference]: Without dead ends: 66 [2020-10-20 05:54:59,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-20 05:54:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-20 05:54:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 05:54:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-10-20 05:54:59,076 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2020-10-20 05:54:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:59,077 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-10-20 05:54:59,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:54:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-10-20 05:54:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 05:54:59,078 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:59,078 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] [2020-10-20 05:54:59,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-20 05:54:59,282 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:54:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:59,283 INFO L82 PathProgramCache]: Analyzing trace with hash -25957239, now seen corresponding path program 1 times [2020-10-20 05:54:59,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:59,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25367576] [2020-10-20 05:54:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-20 05:54:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:59,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-20 05:54:59,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:59,454 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:54:59,454 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:59,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:59,463 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:59,463 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-10-20 05:54:59,506 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:59,506 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 44 [2020-10-20 05:54:59,507 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:59,525 INFO L625 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2020-10-20 05:54:59,526 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:59,526 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-10-20 05:54:59,592 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 05:54:59,593 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 27 treesize of output 22 [2020-10-20 05:54:59,593 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:59,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:59,612 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:54:59,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-10-20 05:54:59,674 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:59,674 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 30 treesize of output 26 [2020-10-20 05:54:59,674 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:59,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:59,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:59,679 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:13 [2020-10-20 05:54:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:59,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:59,864 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 32 treesize of output 28 [2020-10-20 05:54:59,865 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:54:59,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:59,887 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:59,887 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:28 [2020-10-20 05:54:59,998 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:55:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:55:00,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25367576] [2020-10-20 05:55:00,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 05:55:00,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-10-20 05:55:00,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957457976] [2020-10-20 05:55:00,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 05:55:00,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:55:00,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 05:55:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-20 05:55:00,018 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 14 states. [2020-10-20 05:55:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:55:01,916 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2020-10-20 05:55:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:55:01,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2020-10-20 05:55:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:55:01,918 INFO L225 Difference]: With dead ends: 72 [2020-10-20 05:55:01,918 INFO L226 Difference]: Without dead ends: 72 [2020-10-20 05:55:01,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-10-20 05:55:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-20 05:55:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-10-20 05:55:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 05:55:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-10-20 05:55:01,923 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 28 [2020-10-20 05:55:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:55:01,923 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-10-20 05:55:01,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 05:55:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-10-20 05:55:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 05:55:01,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:55:01,925 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] [2020-10-20 05:55:02,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-10-20 05:55:02,135 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2020-10-20 05:55:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:55:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -25957238, now seen corresponding path program 1 times [2020-10-20 05:55:02,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:55:02,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345329370] [2020-10-20 05:55:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-10-20 05:55:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:55:02,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-20 05:55:02,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:55:02,342 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:55:02,342 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,363 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:55:02,363 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,375 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,376 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-10-20 05:55:02,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:55:02,434 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2020-10-20 05:55:02,435 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,465 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,466 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2020-10-20 05:55:02,466 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345329370] [2020-10-20 05:55:02,483 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:55:02,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1816599653] [2020-10-20 05:55:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 05:55:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:55:02,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2020-10-20 05:55:02,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:55:02,855 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:55:02,855 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,878 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 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 05:55:02,879 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,891 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,892 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2020-10-20 05:55:02,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:55:02,934 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-10-20 05:55:02,935 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,970 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,970 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-10-20 05:55:02,971 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:02,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:02,989 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:55:02,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329460022] [2020-10-20 05:55:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:55:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:55:03,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-20 05:55:03,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:55:03,162 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:55:03,162 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:03,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:03,187 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:55:03,187 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:03,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:03,203 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:55:03,204 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2020-10-20 05:55:03,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 05:55:03,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2020-10-20 05:55:03,217 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:03,235 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:03,247 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:03,247 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2020-10-20 05:55:03,248 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:55:03,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:55:03,262 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:55:03,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:55:03,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-20 05:55:03,263 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-20 05:55:03,263 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 05:55:03,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 05:55:03,881 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-20 05:55:03,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:55:03 BoogieIcfgContainer [2020-10-20 05:55:03,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 05:55:03,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 05:55:03,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 05:55:03,882 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 05:55:03,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:46" (3/4) ... [2020-10-20 05:55:03,885 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 05:55:03,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 05:55:03,886 INFO L168 Benchmark]: Toolchain (without parser) took 18842.10 ms. Allocated memory was 34.1 MB in the beginning and 79.7 MB in the end (delta: 45.6 MB). Free memory was 9.8 MB in the beginning and 20.0 MB in the end (delta: -10.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 14.3 GB. [2020-10-20 05:55:03,886 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 33.6 MB. Free memory was 18.3 MB in the beginning and 18.3 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. [2020-10-20 05:55:03,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.49 ms. Allocated memory was 34.1 MB in the beginning and 44.0 MB in the end (delta: 10.0 MB). Free memory was 8.9 MB in the beginning and 22.9 MB in the end (delta: -14.0 MB). Peak memory consumption was 8.7 MB. Max. memory is 14.3 GB. [2020-10-20 05:55:03,887 INFO L168 Benchmark]: Boogie Preprocessor took 74.09 ms. Allocated memory is still 44.0 MB. Free memory was 22.9 MB in the beginning and 19.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 05:55:03,887 INFO L168 Benchmark]: RCFGBuilder took 901.87 ms. Allocated memory was 44.0 MB in the beginning and 47.2 MB in the end (delta: 3.1 MB). Free memory was 19.5 MB in the beginning and 24.3 MB in the end (delta: -4.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 14.3 GB. [2020-10-20 05:55:03,888 INFO L168 Benchmark]: TraceAbstraction took 17110.48 ms. Allocated memory was 47.2 MB in the beginning and 79.7 MB in the end (delta: 32.5 MB). Free memory was 24.0 MB in the beginning and 21.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 35.4 MB. Max. memory is 14.3 GB. [2020-10-20 05:55:03,888 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 79.7 MB. Free memory was 21.1 MB in the beginning and 20.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 14.3 GB. [2020-10-20 05:55:03,891 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.19 ms. Allocated memory is still 33.6 MB. Free memory was 18.3 MB in the beginning and 18.3 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 742.49 ms. Allocated memory was 34.1 MB in the beginning and 44.0 MB in the end (delta: 10.0 MB). Free memory was 8.9 MB in the beginning and 22.9 MB in the end (delta: -14.0 MB). Peak memory consumption was 8.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 74.09 ms. Allocated memory is still 44.0 MB. Free memory was 22.9 MB in the beginning and 19.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 901.87 ms. Allocated memory was 44.0 MB in the beginning and 47.2 MB in the end (delta: 3.1 MB). Free memory was 19.5 MB in the beginning and 24.3 MB in the end (delta: -4.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 17110.48 ms. Allocated memory was 47.2 MB in the beginning and 79.7 MB in the end (delta: 32.5 MB). Free memory was 24.0 MB in the beginning and 21.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 35.4 MB. Max. memory is 14.3 GB. * Witness Printer took 3.36 ms. Allocated memory is still 79.7 MB. Free memory was 21.1 MB in the beginning and 20.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 533]: 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: [L539] struct item *list = ((void *)0); [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) [L531] item->next = *plist [L532] EXPR item->next [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L535] *plist = item [L541] RET append(&list) [L542] COND TRUE __VERIFIER_nondet_int() [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) [L531] item->next = *plist [L532] EXPR item->next [L532-L534] (item->next) ? item->next->data : malloc(sizeof *item) [L533] EXPR item->next [L533] item->next->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 114 locations, 42 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 17.0s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 563 SDtfs, 530 SDslu, 1426 SDs, 0 SdLazy, 1456 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 308 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, 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, 11 MinimizatonAttempts, 46 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 350 ConstructedInterpolants, 24 QuantifiedInterpolants, 53147 SizeOfPredicates, 99 NumberOfNonLiveVariables, 1269 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 4/14 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...