./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/list-ext3-properties/dll_nullified-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:19:26,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:19:26,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:19:26,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:19:26,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:19:26,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:19:26,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:19:26,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:19:26,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:19:26,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:19:26,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:19:26,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:19:26,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:19:26,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:19:26,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:19:26,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:19:26,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:19:26,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:19:26,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:19:26,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:19:26,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:19:26,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:19:26,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:19:26,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:19:26,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:19:26,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:19:26,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:19:26,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:19:26,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:19:26,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:19:26,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:19:26,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:19:26,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:19:26,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:19:26,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:19:26,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:19:26,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:19:26,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:19:26,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:19:26,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:19:26,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:19:26,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-10-20 06:19:26,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:19:26,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:19:26,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:19:26,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:19:26,542 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:19:26,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:19:26,542 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:19:26,543 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:19:26,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:19:26,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:19:26,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:19:26,544 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 06:19:26,544 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 06:19:26,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 06:19:26,544 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 06:19:26,545 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:19:26,545 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:19:26,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:19:26,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:19:26,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 06:19:26,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 06:19:26,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 06:19:26,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:19:26,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 06:19:26,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:19:26,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 06:19:26,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:19:26,548 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-memcleanup) ) 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 -> c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 [2020-10-20 06:19:26,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:19:26,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:19:26,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:19:26,818 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:19:26,819 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:19:26,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2020-10-20 06:19:26,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c62eeb8/d77fb59e22f94159a3ad8e37dbf3184d/FLAGa4355ea58 [2020-10-20 06:19:27,514 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:19:27,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2020-10-20 06:19:27,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c62eeb8/d77fb59e22f94159a3ad8e37dbf3184d/FLAGa4355ea58 [2020-10-20 06:19:27,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c62eeb8/d77fb59e22f94159a3ad8e37dbf3184d [2020-10-20 06:19:27,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:19:27,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 06:19:27,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:19:27,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:19:27,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:19:27,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:19:27" (1/1) ... [2020-10-20 06:19:27,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46190216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:27, skipping insertion in model container [2020-10-20 06:19:27,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:19:27" (1/1) ... [2020-10-20 06:19:27,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:19:27,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:19:28,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:19:28,196 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:19:28,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:19:28,337 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:19:28,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28 WrapperNode [2020-10-20 06:19:28,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:19:28,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:19:28,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:19:28,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:19:28,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:19:28,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:19:28,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:19:28,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:19:28,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19: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 06:19:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 06:19:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:19:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 06:19:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 06:19:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 06:19:28,470 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-10-20 06:19:28,470 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-10-20 06:19:28,470 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 06:19:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 06:19:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 06:19:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 06:19:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 06:19:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 06:19:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:19:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 06:19:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 06:19:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 06:19:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 06:19:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 06:19:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 06:19:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 06:19:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 06:19:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 06:19:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 06:19:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 06:19:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 06:19:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 06:19:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 06:19:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 06:19:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 06:19:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 06:19:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 06:19:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 06:19:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 06:19:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 06:19:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 06:19:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 06:19:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 06:19:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 06:19:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 06:19:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 06:19:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 06:19:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 06:19:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 06:19:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 06:19:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 06:19:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 06:19:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 06:19:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 06:19:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 06:19:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 06:19:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 06:19:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 06:19:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 06:19:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 06:19:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 06:19:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 06:19:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 06:19:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 06:19:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 06:19:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 06:19:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 06:19:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 06:19:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 06:19:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 06:19:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 06:19:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 06:19:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 06:19:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 06:19:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 06:19:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 06:19:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-20 06:19:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 06:19:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 06:19:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 06:19:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 06:19:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 06:19:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 06:19:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 06:19:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 06:19:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 06:19:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 06:19:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 06:19:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 06:19:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 06:19:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 06:19:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 06:19:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 06:19:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 06:19:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 06:19:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 06:19:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 06:19:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 06:19:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 06:19:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 06:19:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 06:19:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 06:19:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 06:19:28,491 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 06:19:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 06:19:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 06:19:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 06:19:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 06:19:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 06:19:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 06:19:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 06:19:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 06:19:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 06:19:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 06:19:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 06:19:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 06:19:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 06:19:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 06:19:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 06:19:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 06:19:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 06:19:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 06:19:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 06:19:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 06:19:28,494 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-10-20 06:19:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-10-20 06:19:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 06:19:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:19:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 06:19:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 06:19:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 06:19:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:19:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:19:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 06:19:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:19:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:19:28,881 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-10-20 06:19:29,187 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:19:29,187 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-10-20 06:19:29,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:19:29 BoogieIcfgContainer [2020-10-20 06:19:29,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:19:29,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 06:19:29,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 06:19:29,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 06:19:29,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 06:19:27" (1/3) ... [2020-10-20 06:19:29,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229347ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 06:19:29, skipping insertion in model container [2020-10-20 06:19:29,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (2/3) ... [2020-10-20 06:19:29,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229347ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 06:19:29, skipping insertion in model container [2020-10-20 06:19:29,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:19:29" (3/3) ... [2020-10-20 06:19:29,198 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-10-20 06:19:29,211 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 06:19:29,218 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2020-10-20 06:19:29,233 INFO L253 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2020-10-20 06:19:29,254 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 06:19:29,254 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 06:19:29,254 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 06:19:29,254 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:19:29,254 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:19:29,255 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 06:19:29,255 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:19:29,255 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 06:19:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2020-10-20 06:19:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 06:19:29,283 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:29,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:29,284 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1623618837, now seen corresponding path program 1 times [2020-10-20 06:19:29,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:29,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567993833] [2020-10-20 06:19:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:29,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:29,546 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 06:19:29,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567993833] [2020-10-20 06:19:29,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:29,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:19:29,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544416987] [2020-10-20 06:19:29,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 06:19:29,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:29,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:19:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:19:29,576 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 4 states. [2020-10-20 06:19:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:30,033 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2020-10-20 06:19:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:19:30,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 06:19:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:30,047 INFO L225 Difference]: With dead ends: 156 [2020-10-20 06:19:30,048 INFO L226 Difference]: Without dead ends: 147 [2020-10-20 06:19:30,050 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 06:19:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-20 06:19:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2020-10-20 06:19:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-20 06:19:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2020-10-20 06:19:30,100 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 11 [2020-10-20 06:19:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:30,100 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2020-10-20 06:19:30,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 06:19:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2020-10-20 06:19:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 06:19:30,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:30,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:30,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 06:19:30,103 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1623618838, now seen corresponding path program 1 times [2020-10-20 06:19:30,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:30,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468596817] [2020-10-20 06:19:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,217 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 06:19:30,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468596817] [2020-10-20 06:19:30,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:30,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:19:30,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482921510] [2020-10-20 06:19:30,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 06:19:30,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:19:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:19:30,221 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 4 states. [2020-10-20 06:19:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:30,574 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2020-10-20 06:19:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:19:30,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 06:19:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:30,576 INFO L225 Difference]: With dead ends: 142 [2020-10-20 06:19:30,576 INFO L226 Difference]: Without dead ends: 142 [2020-10-20 06:19:30,578 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 06:19:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-20 06:19:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2020-10-20 06:19:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-20 06:19:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2020-10-20 06:19:30,589 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 11 [2020-10-20 06:19:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:30,590 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2020-10-20 06:19:30,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 06:19:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2020-10-20 06:19:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 06:19:30,591 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:30,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:30,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 06:19:30,592 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash -713826160, now seen corresponding path program 1 times [2020-10-20 06:19:30,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:30,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760196786] [2020-10-20 06:19:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,720 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 06:19:30,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760196786] [2020-10-20 06:19:30,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:30,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 06:19:30,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343191558] [2020-10-20 06:19:30,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 06:19:30,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:30,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:19:30,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:19:30,722 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand 7 states. [2020-10-20 06:19:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:31,062 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2020-10-20 06:19:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:19:31,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-20 06:19:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:31,064 INFO L225 Difference]: With dead ends: 103 [2020-10-20 06:19:31,064 INFO L226 Difference]: Without dead ends: 100 [2020-10-20 06:19:31,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:19:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-10-20 06:19:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2020-10-20 06:19:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-20 06:19:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2020-10-20 06:19:31,072 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 14 [2020-10-20 06:19:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:31,073 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2020-10-20 06:19:31,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 06:19:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-10-20 06:19:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 06:19:31,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:31,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:31,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 06:19:31,075 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1424889429, now seen corresponding path program 1 times [2020-10-20 06:19:31,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:31,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168912077] [2020-10-20 06:19:31,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,191 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 06:19:31,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168912077] [2020-10-20 06:19:31,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:31,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:19:31,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237576895] [2020-10-20 06:19:31,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 06:19:31,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:31,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:19:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:19:31,194 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 4 states. [2020-10-20 06:19:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:31,363 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2020-10-20 06:19:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:19:31,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-20 06:19:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:31,365 INFO L225 Difference]: With dead ends: 97 [2020-10-20 06:19:31,365 INFO L226 Difference]: Without dead ends: 97 [2020-10-20 06:19:31,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:19:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-20 06:19:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2020-10-20 06:19:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-20 06:19:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2020-10-20 06:19:31,374 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 20 [2020-10-20 06:19:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:31,374 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2020-10-20 06:19:31,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 06:19:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-10-20 06:19:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 06:19:31,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:31,376 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 06:19:31,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 06:19:31,377 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1016601636, now seen corresponding path program 1 times [2020-10-20 06:19:31,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:31,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029023274] [2020-10-20 06:19:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:31,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029023274] [2020-10-20 06:19:31,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:31,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 06:19:31,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703370624] [2020-10-20 06:19:31,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:19:31,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:19:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:19:31,580 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 9 states. [2020-10-20 06:19:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:31,983 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-10-20 06:19:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:19:31,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-20 06:19:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:31,985 INFO L225 Difference]: With dead ends: 96 [2020-10-20 06:19:31,985 INFO L226 Difference]: Without dead ends: 96 [2020-10-20 06:19:31,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:19:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-20 06:19:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-10-20 06:19:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-20 06:19:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2020-10-20 06:19:31,998 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2020-10-20 06:19:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:31,998 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2020-10-20 06:19:31,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:19:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2020-10-20 06:19:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 06:19:32,000 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:32,000 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 06:19:32,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 06:19:32,001 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1016601637, now seen corresponding path program 1 times [2020-10-20 06:19:32,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:32,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005530370] [2020-10-20 06:19:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:32,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:32,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:32,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005530370] [2020-10-20 06:19:32,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720835858] [2020-10-20 06:19:32,243 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 06:19:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:32,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:19:32,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:32,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:32,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-10-20 06:19:32,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425536672] [2020-10-20 06:19:32,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:19:32,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:19:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:19:32,451 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 9 states. [2020-10-20 06:19:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:32,760 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2020-10-20 06:19:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:19:32,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-20 06:19:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:32,762 INFO L225 Difference]: With dead ends: 108 [2020-10-20 06:19:32,762 INFO L226 Difference]: Without dead ends: 105 [2020-10-20 06:19:32,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:19:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-20 06:19:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2020-10-20 06:19:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-20 06:19:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2020-10-20 06:19:32,768 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 26 [2020-10-20 06:19:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:32,768 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2020-10-20 06:19:32,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:19:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2020-10-20 06:19:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 06:19:32,769 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:32,770 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:32,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-20 06:19:32,982 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash -872929728, now seen corresponding path program 1 times [2020-10-20 06:19:32,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:32,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395570960] [2020-10-20 06:19:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:33,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395570960] [2020-10-20 06:19:33,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350930861] [2020-10-20 06:19:33,112 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 06:19:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:19:33,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:33,289 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 06:19:33,290 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:33,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:33,297 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:33,297 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 06:19:33,349 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:33,350 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 12 treesize of output 28 [2020-10-20 06:19:33,351 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:33,368 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-10-20 06:19:33,369 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 06:19:33,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-10-20 06:19:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:33,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:33,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2020-10-20 06:19:33,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913913037] [2020-10-20 06:19:33,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:19:33,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:19:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:19:33,392 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 9 states. [2020-10-20 06:19:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:33,696 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2020-10-20 06:19:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:19:33,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-10-20 06:19:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:33,698 INFO L225 Difference]: With dead ends: 91 [2020-10-20 06:19:33,698 INFO L226 Difference]: Without dead ends: 91 [2020-10-20 06:19:33,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:19:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-20 06:19:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-20 06:19:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 06:19:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2020-10-20 06:19:33,704 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 32 [2020-10-20 06:19:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:33,705 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2020-10-20 06:19:33,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:19:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2020-10-20 06:19:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 06:19:33,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:33,707 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:33,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:33,908 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:33,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:33,909 INFO L82 PathProgramCache]: Analyzing trace with hash 603691449, now seen corresponding path program 2 times [2020-10-20 06:19:33,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:33,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17554660] [2020-10-20 06:19:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:34,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17554660] [2020-10-20 06:19:34,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660126729] [2020-10-20 06:19:34,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:34,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:19:34,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:19:34,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:19:34,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:34,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:34,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2020-10-20 06:19:34,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814096232] [2020-10-20 06:19:34,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:19:34,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:34,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:19:34,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:19:34,218 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 11 states. [2020-10-20 06:19:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:34,660 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2020-10-20 06:19:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:19:34,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-10-20 06:19:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:34,662 INFO L225 Difference]: With dead ends: 119 [2020-10-20 06:19:34,662 INFO L226 Difference]: Without dead ends: 116 [2020-10-20 06:19:34,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-10-20 06:19:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-20 06:19:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2020-10-20 06:19:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-20 06:19:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2020-10-20 06:19:34,668 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 38 [2020-10-20 06:19:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:34,669 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2020-10-20 06:19:34,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:19:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2020-10-20 06:19:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-20 06:19:34,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:34,671 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:34,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:34,883 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash -222202587, now seen corresponding path program 1 times [2020-10-20 06:19:34,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:34,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977783498] [2020-10-20 06:19:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:34,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:34,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:35,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977783498] [2020-10-20 06:19:35,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132596140] [2020-10-20 06:19:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:19:35,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:35,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:35,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-10-20 06:19:35,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003221836] [2020-10-20 06:19:35,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:19:35,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:19:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:19:35,231 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 11 states. [2020-10-20 06:19:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:35,541 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-10-20 06:19:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:19:35,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-10-20 06:19:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:35,543 INFO L225 Difference]: With dead ends: 132 [2020-10-20 06:19:35,544 INFO L226 Difference]: Without dead ends: 129 [2020-10-20 06:19:35,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-10-20 06:19:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-20 06:19:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2020-10-20 06:19:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-20 06:19:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2020-10-20 06:19:35,557 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 52 [2020-10-20 06:19:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:35,558 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2020-10-20 06:19:35,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:19:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2020-10-20 06:19:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-20 06:19:35,565 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:35,566 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:35,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:35,781 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash -710767347, now seen corresponding path program 2 times [2020-10-20 06:19:35,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:35,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276087773] [2020-10-20 06:19:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:36,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276087773] [2020-10-20 06:19:36,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182887039] [2020-10-20 06:19:36,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:36,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:19:36,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:19:36,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:19:36,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:36,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:36,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2020-10-20 06:19:36,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075654613] [2020-10-20 06:19:36,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:19:36,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:36,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:19:36,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:19:36,335 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 12 states. [2020-10-20 06:19:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:36,668 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2020-10-20 06:19:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:19:36,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-10-20 06:19:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:36,670 INFO L225 Difference]: With dead ends: 145 [2020-10-20 06:19:36,670 INFO L226 Difference]: Without dead ends: 142 [2020-10-20 06:19:36,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:19:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-20 06:19:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2020-10-20 06:19:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-20 06:19:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2020-10-20 06:19:36,675 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 65 [2020-10-20 06:19:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:36,675 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2020-10-20 06:19:36,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:19:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2020-10-20 06:19:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-20 06:19:36,677 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:36,677 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:36,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 06:19:36,881 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:36,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:36,882 INFO L82 PathProgramCache]: Analyzing trace with hash 108891685, now seen corresponding path program 3 times [2020-10-20 06:19:36,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:36,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974542392] [2020-10-20 06:19:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:36,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:36,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-10-20 06:19:37,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974542392] [2020-10-20 06:19:37,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:37,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 06:19:37,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881654914] [2020-10-20 06:19:37,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:19:37,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:19:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:19:37,120 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 9 states. [2020-10-20 06:19:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:37,542 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2020-10-20 06:19:37,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:19:37,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-20 06:19:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:37,544 INFO L225 Difference]: With dead ends: 164 [2020-10-20 06:19:37,544 INFO L226 Difference]: Without dead ends: 164 [2020-10-20 06:19:37,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:19:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-10-20 06:19:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2020-10-20 06:19:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-20 06:19:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2020-10-20 06:19:37,550 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 78 [2020-10-20 06:19:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:37,551 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2020-10-20 06:19:37,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:19:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2020-10-20 06:19:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-20 06:19:37,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:37,552 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:37,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 06:19:37,553 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1392676980, now seen corresponding path program 1 times [2020-10-20 06:19:37,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:37,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377887410] [2020-10-20 06:19:37,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:37,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:37,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-10-20 06:19:37,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377887410] [2020-10-20 06:19:37,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:37,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 06:19:37,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448325094] [2020-10-20 06:19:37,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:19:37,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:37,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:19:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:19:37,753 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 9 states. [2020-10-20 06:19:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:38,086 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2020-10-20 06:19:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:19:38,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-10-20 06:19:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:38,090 INFO L225 Difference]: With dead ends: 161 [2020-10-20 06:19:38,090 INFO L226 Difference]: Without dead ends: 161 [2020-10-20 06:19:38,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:19:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-20 06:19:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-10-20 06:19:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-20 06:19:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2020-10-20 06:19:38,095 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 82 [2020-10-20 06:19:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:38,095 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2020-10-20 06:19:38,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:19:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2020-10-20 06:19:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-20 06:19:38,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:38,097 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:38,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 06:19:38,098 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1468486517, now seen corresponding path program 1 times [2020-10-20 06:19:38,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:38,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729422548] [2020-10-20 06:19:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-20 06:19:38,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729422548] [2020-10-20 06:19:38,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705126164] [2020-10-20 06:19:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 46 conjunts are in the unsatisfiable core [2020-10-20 06:19:38,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:38,823 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 06:19:38,823 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,829 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,829 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 06:19:38,878 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,878 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 06:19:38,879 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,881 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,882 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-10-20 06:19:38,893 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 06:19:38,894 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,899 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,899 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-10-20 06:19:38,921 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-20 06:19:38,940 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-10-20 06:19:38,940 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 29 treesize of output 33 [2020-10-20 06:19:38,941 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,955 INFO L625 ElimStorePlain]: treesize reduction 13, result has 56.7 percent of original size [2020-10-20 06:19:38,955 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,961 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,961 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2020-10-20 06:19:39,015 INFO L350 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2020-10-20 06:19:39,016 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2020-10-20 06:19:39,020 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:39,029 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 06:19:39,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2020-10-20 06:19:39,054 INFO L350 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2020-10-20 06:19:39,055 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2020-10-20 06:19:39,056 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:39,062 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,063 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-10-20 06:19:39,096 INFO L350 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2020-10-20 06:19:39,096 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2020-10-20 06:19:39,097 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:39,101 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2020-10-20 06:19:39,115 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 06:19:39,116 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2020-10-20 06:19:39,117 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:39,124 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 06:19:39,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2020-10-20 06:19:39,242 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 06:19:39,242 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 24 treesize of output 10 [2020-10-20 06:19:39,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:39,258 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 06:19:39,259 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:3 [2020-10-20 06:19:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 06:19:39,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:39,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2020-10-20 06:19:39,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596584163] [2020-10-20 06:19:39,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-20 06:19:39,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-20 06:19:39,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2020-10-20 06:19:39,271 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 22 states. [2020-10-20 06:19:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:40,086 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2020-10-20 06:19:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 06:19:40,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2020-10-20 06:19:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:40,087 INFO L225 Difference]: With dead ends: 161 [2020-10-20 06:19:40,087 INFO L226 Difference]: Without dead ends: 161 [2020-10-20 06:19:40,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2020-10-20 06:19:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-20 06:19:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-10-20 06:19:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-20 06:19:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2020-10-20 06:19:40,093 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 88 [2020-10-20 06:19:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:40,093 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2020-10-20 06:19:40,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-20 06:19:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2020-10-20 06:19:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-20 06:19:40,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:40,094 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:40,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:40,306 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1744307152, now seen corresponding path program 1 times [2020-10-20 06:19:40,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:40,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302296618] [2020-10-20 06:19:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:40,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:40,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-20 06:19:40,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302296618] [2020-10-20 06:19:40,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264351720] [2020-10-20 06:19:40,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:41,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 49 conjunts are in the unsatisfiable core [2020-10-20 06:19:41,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:41,064 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 06:19:41,064 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,070 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,071 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 06:19:41,133 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,133 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 06:19:41,134 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,139 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-10-20 06:19:41,164 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 13 treesize of output 9 [2020-10-20 06:19:41,165 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,171 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-10-20 06:19:41,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:41,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-10-20 06:19:41,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,214 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 06:19:41,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2020-10-20 06:19:41,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:41,225 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-20 06:19:41,227 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,232 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,233 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2020-10-20 06:19:41,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:41,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-20 06:19:41,240 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,246 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,246 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2020-10-20 06:19:41,260 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-20 06:19:41,261 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,268 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 06:19:41,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:13 [2020-10-20 06:19:41,415 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 06:19:41,416 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:41,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:41,418 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 06:19:41,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-10-20 06:19:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 06:19:41,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:41,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2020-10-20 06:19:41,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711330864] [2020-10-20 06:19:41,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-20 06:19:41,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-20 06:19:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2020-10-20 06:19:41,437 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 24 states. [2020-10-20 06:19:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:42,492 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2020-10-20 06:19:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 06:19:42,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2020-10-20 06:19:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:42,494 INFO L225 Difference]: With dead ends: 161 [2020-10-20 06:19:42,494 INFO L226 Difference]: Without dead ends: 161 [2020-10-20 06:19:42,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2020-10-20 06:19:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-20 06:19:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-10-20 06:19:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-20 06:19:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2020-10-20 06:19:42,500 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 90 [2020-10-20 06:19:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:42,500 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2020-10-20 06:19:42,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-20 06:19:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2020-10-20 06:19:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-20 06:19:42,502 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:42,502 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:42,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-20 06:19:42,712 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -724764429, now seen corresponding path program 1 times [2020-10-20 06:19:42,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:42,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217951778] [2020-10-20 06:19:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:42,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:42,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:19:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-20 06:19:43,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217951778] [2020-10-20 06:19:43,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325460147] [2020-10-20 06:19:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:43,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 46 conjunts are in the unsatisfiable core [2020-10-20 06:19:43,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:43,190 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 06:19:43,190 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,195 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 06:19:43,228 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,228 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 06:19:43,229 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,233 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,233 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2020-10-20 06:19:43,258 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 06:19:43,258 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,267 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-10-20 06:19:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,309 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-20 06:19:43,310 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,319 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,319 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-10-20 06:19:43,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,374 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-10-20 06:19:43,375 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,385 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,386 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 06:19:43,386 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2020-10-20 06:19:43,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-10-20 06:19:43,405 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,413 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,414 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,414 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2020-10-20 06:19:43,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,425 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-10-20 06:19:43,426 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,434 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,435 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2020-10-20 06:19:43,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,451 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-10-20 06:19:43,452 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,465 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 06:19:43,465 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:23 [2020-10-20 06:19:43,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:19:43,721 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:43,730 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,730 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2020-10-20 06:19:43,731 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,744 INFO L625 ElimStorePlain]: treesize reduction 3, result has 81.3 percent of original size [2020-10-20 06:19:43,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,747 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2020-10-20 06:19:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 06:19:43,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:43,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2020-10-20 06:19:43,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66628764] [2020-10-20 06:19:43,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-20 06:19:43,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-20 06:19:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2020-10-20 06:19:43,766 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 24 states. [2020-10-20 06:19:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:46,446 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2020-10-20 06:19:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 06:19:46,447 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-10-20 06:19:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:46,449 INFO L225 Difference]: With dead ends: 161 [2020-10-20 06:19:46,449 INFO L226 Difference]: Without dead ends: 161 [2020-10-20 06:19:46,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2020-10-20 06:19:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-10-20 06:19:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2020-10-20 06:19:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-20 06:19:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2020-10-20 06:19:46,454 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 91 [2020-10-20 06:19:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:46,454 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2020-10-20 06:19:46,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-20 06:19:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2020-10-20 06:19:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-20 06:19:46,455 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:46,456 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:46,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-20 06:19:46,666 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, dll_createErr4REQUIRES_VIOLATION, dll_createErr9REQUIRES_VIOLATION, dll_createErr8REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr11REQUIRES_VIOLATION, dll_createErr10REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr21ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2020-10-20 06:19:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1598496843, now seen corresponding path program 1 times [2020-10-20 06:19:46,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:46,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729700140] [2020-10-20 06:19:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:19:46,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:19:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:19:46,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:19:46,870 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:19:46,871 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 06:19:46,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 06:19:46,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 06:19:46 BoogieIcfgContainer [2020-10-20 06:19:46,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 06:19:46,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:19:46,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:19:46,960 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:19:46,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:19:29" (3/4) ... [2020-10-20 06:19:46,962 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 06:19:47,052 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:19:47,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:19:47,054 INFO L168 Benchmark]: Toolchain (without parser) took 19308.41 ms. Allocated memory was 38.3 MB in the beginning and 145.8 MB in the end (delta: 107.5 MB). Free memory was 12.7 MB in the beginning and 95.0 MB in the end (delta: -82.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:19:47,054 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 29.9 MB. Free memory was 15.7 MB in the beginning and 15.7 MB in the end (delta: 25.2 kB). Peak memory consumption was 25.2 kB. Max. memory is 14.3 GB. [2020-10-20 06:19:47,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.31 ms. Allocated memory was 38.3 MB in the beginning and 41.4 MB in the end (delta: 3.1 MB). Free memory was 11.8 MB in the beginning and 17.5 MB in the end (delta: -5.7 MB). Peak memory consumption was 5.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:19:47,055 INFO L168 Benchmark]: Boogie Preprocessor took 67.45 ms. Allocated memory is still 41.4 MB. Free memory was 17.5 MB in the beginning and 14.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:19:47,056 INFO L168 Benchmark]: RCFGBuilder took 783.45 ms. Allocated memory was 41.4 MB in the beginning and 45.1 MB in the end (delta: 3.7 MB). Free memory was 14.4 MB in the beginning and 15.4 MB in the end (delta: -977.1 kB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:19:47,056 INFO L168 Benchmark]: TraceAbstraction took 17768.22 ms. Allocated memory was 45.1 MB in the beginning and 145.8 MB in the end (delta: 100.7 MB). Free memory was 15.0 MB in the beginning and 102.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 112.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:19:47,056 INFO L168 Benchmark]: Witness Printer took 93.26 ms. Allocated memory is still 145.8 MB. Free memory was 102.0 MB in the beginning and 95.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:19:47,059 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34 ms. Allocated memory is still 29.9 MB. Free memory was 15.7 MB in the beginning and 15.7 MB in the end (delta: 25.2 kB). Peak memory consumption was 25.2 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 585.31 ms. Allocated memory was 38.3 MB in the beginning and 41.4 MB in the end (delta: 3.1 MB). Free memory was 11.8 MB in the beginning and 17.5 MB in the end (delta: -5.7 MB). Peak memory consumption was 5.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 67.45 ms. Allocated memory is still 41.4 MB. Free memory was 17.5 MB in the beginning and 14.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 783.45 ms. Allocated memory was 41.4 MB in the beginning and 45.1 MB in the end (delta: 3.7 MB). Free memory was 14.4 MB in the beginning and 15.4 MB in the end (delta: -977.1 kB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 17768.22 ms. Allocated memory was 45.1 MB in the beginning and 145.8 MB in the end (delta: 100.7 MB). Free memory was 15.0 MB in the beginning and 102.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 112.6 MB. Max. memory is 14.3 GB. * Witness Printer took 93.26 ms. Allocated memory is still 145.8 MB. Free memory was 102.0 MB in the beginning and 95.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; VAL [len=5] [L600] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L600] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 111 locations, 35 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.6s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1037 SDtfs, 1412 SDslu, 5091 SDs, 0 SdLazy, 5384 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 512 SyntacticMatches, 12 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=11, 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, 15 MinimizatonAttempts, 172 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1298 NumberOfCodeBlocks, 1298 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1183 ConstructedInterpolants, 11 QuantifiedInterpolants, 381188 SizeOfPredicates, 79 NumberOfNonLiveVariables, 2738 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 965/1339 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 proved your program to be incorrect! Received shutdown request...