./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f6fb2bb1 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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-simple/sll2c_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c7de5fb661efaece6ac30dedf2d78ac089ace75 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:49:54,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:49:54,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:49:54,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:49:54,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:49:54,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:49:54,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:49:54,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:49:54,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:49:54,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:49:54,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:49:54,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:49:54,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:49:54,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:49:54,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:49:54,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:49:54,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:49:54,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:49:54,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:49:54,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:49:54,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:49:54,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:49:54,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:49:54,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:49:54,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:49:54,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:49:54,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:49:54,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:49:54,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:49:54,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:49:54,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:49:54,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:49:54,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:49:54,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:49:54,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:49:54,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:49:54,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:49:54,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:49:54,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:49:54,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:49:54,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:49:54,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 19:49:54,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:49:54,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:49:54,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:49:54,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:49:54,432 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:49:54,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:49:54,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 19:49:54,434 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:49:54,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:49:54,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 19:49:54,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:49:54,435 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 19:49:54,435 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 19:49:54,435 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 19:49:54,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:49:54,436 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 19:49:54,436 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 19:49:54,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 19:49:54,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:49:54,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:49:54,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:49:54,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:49:54,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:49:54,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:49:54,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:49:54,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:49:54,439 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 19:49:54,439 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 19:49:54,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 19:49:54,440 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c7de5fb661efaece6ac30dedf2d78ac089ace75 [2019-11-19 19:49:54,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:49:54,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:49:54,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:49:54,789 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:49:54,789 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:49:54,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2019-11-19 19:49:54,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea18c22df/92519489e6614cff8ce80f79b5d20198/FLAGeca1a6ffe [2019-11-19 19:49:55,472 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:49:55,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2019-11-19 19:49:55,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea18c22df/92519489e6614cff8ce80f79b5d20198/FLAGeca1a6ffe [2019-11-19 19:49:55,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea18c22df/92519489e6614cff8ce80f79b5d20198 [2019-11-19 19:49:55,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:49:55,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 19:49:55,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:49:55,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:49:55,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:49:55,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:55" (1/1) ... [2019-11-19 19:49:55,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c9bd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:55, skipping insertion in model container [2019-11-19 19:49:55,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:55" (1/1) ... [2019-11-19 19:49:55,715 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:49:55,771 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:49:56,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:49:56,232 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:49:56,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:49:56,357 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:49:56,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56 WrapperNode [2019-11-19 19:49:56,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:49:56,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:49:56,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:49:56,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:49:56,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (1/1) ... [2019-11-19 19:49:56,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (1/1) ... [2019-11-19 19:49:56,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (1/1) ... [2019-11-19 19:49:56,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (1/1) ... [2019-11-19 19:49:56,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (1/1) ... [2019-11-19 19:49:56,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (1/1) ... [2019-11-19 19:49:56,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (1/1) ... [2019-11-19 19:49:56,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:49:56,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:49:56,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:49:56,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:49:56,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (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 [2019-11-19 19:49:56,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 19:49:56,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:49:56,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-19 19:49:56,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-19 19:49:56,524 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-19 19:49:56,524 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-19 19:49:56,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-19 19:49:56,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-19 19:49:56,525 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2019-11-19 19:49:56,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 19:49:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-19 19:49:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-19 19:49:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-19 19:49:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-19 19:49:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-19 19:49:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-19 19:49:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-19 19:49:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-19 19:49:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-19 19:49:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-19 19:49:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-19 19:49:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-19 19:49:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-19 19:49:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-19 19:49:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-19 19:49:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-19 19:49:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-19 19:49:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-19 19:49:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-19 19:49:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-19 19:49:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-19 19:49:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-19 19:49:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-19 19:49:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-19 19:49:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-19 19:49:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-19 19:49:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-19 19:49:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-19 19:49:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-19 19:49:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-19 19:49:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-19 19:49:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-19 19:49:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-19 19:49:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-19 19:49:56,532 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-19 19:49:56,533 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-19 19:49:56,533 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-19 19:49:56,533 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-19 19:49:56,533 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-19 19:49:56,534 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-19 19:49:56,534 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-19 19:49:56,534 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-19 19:49:56,534 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-19 19:49:56,534 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-19 19:49:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-19 19:49:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-19 19:49:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-19 19:49:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-19 19:49:56,535 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-19 19:49:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-19 19:49:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-19 19:49:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-19 19:49:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-19 19:49:56,536 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-19 19:49:56,537 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-19 19:49:56,537 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-19 19:49:56,537 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-19 19:49:56,537 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-19 19:49:56,537 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-19 19:49:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-19 19:49:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-19 19:49:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-19 19:49:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-19 19:49:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-19 19:49:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-19 19:49:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-19 19:49:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-19 19:49:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-19 19:49:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-19 19:49:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-19 19:49:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-19 19:49:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-19 19:49:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-19 19:49:56,541 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-19 19:49:56,541 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-19 19:49:56,541 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-19 19:49:56,541 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-19 19:49:56,541 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-19 19:49:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-19 19:49:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-19 19:49:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-19 19:49:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-19 19:49:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-19 19:49:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-19 19:49:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-19 19:49:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-19 19:49:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-19 19:49:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-19 19:49:56,544 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-19 19:49:56,544 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-19 19:49:56,544 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-19 19:49:56,544 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-19 19:49:56,544 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-19 19:49:56,545 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-19 19:49:56,545 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-19 19:49:56,545 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-19 19:49:56,545 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-19 19:49:56,545 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-19 19:49:56,545 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-19 19:49:56,546 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-19 19:49:56,546 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-19 19:49:56,546 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-19 19:49:56,546 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-19 19:49:56,546 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-19 19:49:56,547 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-19 19:49:56,547 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-19 19:49:56,547 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-19 19:49:56,547 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-19 19:49:56,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 19:49:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 19:49:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 19:49:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-19 19:49:56,548 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-19 19:49:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 19:49:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 19:49:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2019-11-19 19:49:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 19:49:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 19:49:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 19:49:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 19:49:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 19:49:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:49:56,952 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-19 19:49:57,588 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:49:57,588 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 19:49:57,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:57 BoogieIcfgContainer [2019-11-19 19:49:57,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:49:57,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:49:57,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:49:57,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:49:57,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:49:55" (1/3) ... [2019-11-19 19:49:57,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0285cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:57, skipping insertion in model container [2019-11-19 19:49:57,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:56" (2/3) ... [2019-11-19 19:49:57,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0285cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:57, skipping insertion in model container [2019-11-19 19:49:57,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:57" (3/3) ... [2019-11-19 19:49:57,600 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2019-11-19 19:49:57,610 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:49:57,621 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2019-11-19 19:49:57,635 INFO L249 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2019-11-19 19:49:57,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:49:57,659 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 19:49:57,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:49:57,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:49:57,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:49:57,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:49:57,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:49:57,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:49:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-19 19:49:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 19:49:57,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:49:57,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:49:57,715 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:49:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:49:57,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1474046873, now seen corresponding path program 1 times [2019-11-19 19:49:57,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:49:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [994272330] [2019-11-19 19:49:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:49:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:49:57,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 19:49:58,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:49:58,075 INFO L377 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 [2019-11-19 19:49:58,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:49:58,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:49:58,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:49:58,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 19:49:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:49:58,105 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:49:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:49:58,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [994272330] [2019-11-19 19:49:58,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:49:58,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 19:49:58,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219774832] [2019-11-19 19:49:58,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:49:58,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:49:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:49:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:49:58,162 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-11-19 19:49:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:49:58,480 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2019-11-19 19:49:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:49:58,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 19:49:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:49:58,494 INFO L225 Difference]: With dead ends: 141 [2019-11-19 19:49:58,494 INFO L226 Difference]: Without dead ends: 134 [2019-11-19 19:49:58,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:49:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-19 19:49:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-19 19:49:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-19 19:49:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2019-11-19 19:49:58,550 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 12 [2019-11-19 19:49:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:49:58,551 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2019-11-19 19:49:58,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:49:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2019-11-19 19:49:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 19:49:58,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:49:58,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:49:58,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:49:58,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:49:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:49:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1474046872, now seen corresponding path program 1 times [2019-11-19 19:49:58,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:49:58,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1959472059] [2019-11-19 19:49:58,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:49:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:49:58,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:49:58,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:49:59,011 INFO L377 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 [2019-11-19 19:49:59,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:49:59,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:49:59,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:49:59,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 19:49:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:49:59,038 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:49:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:49:59,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1959472059] [2019-11-19 19:49:59,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:49:59,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-19 19:49:59,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880499914] [2019-11-19 19:49:59,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:49:59,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:49:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:49:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:49:59,082 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2019-11-19 19:49:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:49:59,549 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2019-11-19 19:49:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:49:59,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 19:49:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:49:59,555 INFO L225 Difference]: With dead ends: 132 [2019-11-19 19:49:59,558 INFO L226 Difference]: Without dead ends: 132 [2019-11-19 19:49:59,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:49:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-19 19:49:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-19 19:49:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 19:49:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-11-19 19:49:59,573 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 12 [2019-11-19 19:49:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:49:59,573 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-11-19 19:49:59,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:49:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-11-19 19:49:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 19:49:59,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:49:59,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:49:59,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:49:59,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:49:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:49:59,786 INFO L82 PathProgramCache]: Analyzing trace with hash 889247132, now seen corresponding path program 1 times [2019-11-19 19:49:59,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:49:59,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1673694905] [2019-11-19 19:49:59,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:50:00,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:50:00,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:50:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:50:00,039 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:50:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:50:00,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1673694905] [2019-11-19 19:50:00,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:50:00,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-19 19:50:00,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14055847] [2019-11-19 19:50:00,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:50:00,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:50:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:50:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:50:00,097 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 8 states. [2019-11-19 19:50:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:50:00,186 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2019-11-19 19:50:00,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:50:00,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-19 19:50:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:50:00,189 INFO L225 Difference]: With dead ends: 139 [2019-11-19 19:50:00,189 INFO L226 Difference]: Without dead ends: 139 [2019-11-19 19:50:00,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:50:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-19 19:50:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2019-11-19 19:50:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-19 19:50:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2019-11-19 19:50:00,203 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 19 [2019-11-19 19:50:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:50:00,203 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2019-11-19 19:50:00,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:50:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2019-11-19 19:50:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 19:50:00,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:50:00,204 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:50:00,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:00,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:50:00,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:50:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1411017804, now seen corresponding path program 1 times [2019-11-19 19:50:00,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:50:00,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1235028720] [2019-11-19 19:50:00,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:50:00,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 19:50:00,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:50:00,707 INFO L377 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 [2019-11-19 19:50:00,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:00,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:00,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:50:00,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 19:50:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:50:00,759 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:50:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:50:00,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1235028720] [2019-11-19 19:50:00,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:50:00,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-19 19:50:00,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750832722] [2019-11-19 19:50:00,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 19:50:00,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:50:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 19:50:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:50:00,846 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 6 states. [2019-11-19 19:50:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:50:01,464 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2019-11-19 19:50:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:50:01,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-19 19:50:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:50:01,468 INFO L225 Difference]: With dead ends: 133 [2019-11-19 19:50:01,469 INFO L226 Difference]: Without dead ends: 133 [2019-11-19 19:50:01,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:50:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-19 19:50:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-11-19 19:50:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-19 19:50:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-11-19 19:50:01,479 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 28 [2019-11-19 19:50:01,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:50:01,482 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-11-19 19:50:01,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 19:50:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-11-19 19:50:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 19:50:01,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:50:01,484 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:50:01,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:01,689 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:50:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:50:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1411017803, now seen corresponding path program 1 times [2019-11-19 19:50:01,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:50:01,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [500350035] [2019-11-19 19:50:01,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:50:01,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 19:50:01,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:50:01,932 INFO L377 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 [2019-11-19 19:50:01,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:01,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:01,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:50:01,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 19:50:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:50:02,002 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:50:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:50:02,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [500350035] [2019-11-19 19:50:02,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:50:02,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-19 19:50:02,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86048762] [2019-11-19 19:50:02,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 19:50:02,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:50:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 19:50:02,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:50:02,355 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 10 states. [2019-11-19 19:50:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:50:03,517 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-11-19 19:50:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:50:03,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-19 19:50:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:50:03,519 INFO L225 Difference]: With dead ends: 132 [2019-11-19 19:50:03,520 INFO L226 Difference]: Without dead ends: 132 [2019-11-19 19:50:03,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 19:50:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-19 19:50:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-11-19 19:50:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-19 19:50:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2019-11-19 19:50:03,532 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 28 [2019-11-19 19:50:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:50:03,532 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2019-11-19 19:50:03,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 19:50:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2019-11-19 19:50:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 19:50:03,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:50:03,533 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:50:03,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:03,738 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:50:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:50:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash -786360054, now seen corresponding path program 1 times [2019-11-19 19:50:03,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:50:03,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [550651210] [2019-11-19 19:50:03,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:50:04,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 19:50:04,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:50:04,016 INFO L377 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 [2019-11-19 19:50:04,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:04,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:04,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:50:04,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 19:50:04,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:04,131 INFO L377 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 14 treesize of output 30 [2019-11-19 19:50:04,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:04,155 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 19:50:04,156 INFO L496 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. [2019-11-19 19:50:04,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-19 19:50:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:50:04,174 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:50:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:50:04,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [550651210] [2019-11-19 19:50:04,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:50:04,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-19 19:50:04,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020233919] [2019-11-19 19:50:04,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:50:04,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:50:04,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:50:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:50:04,366 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 9 states. [2019-11-19 19:50:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:50:21,599 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2019-11-19 19:50:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 19:50:21,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-19 19:50:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:50:21,602 INFO L225 Difference]: With dead ends: 163 [2019-11-19 19:50:21,602 INFO L226 Difference]: Without dead ends: 163 [2019-11-19 19:50:21,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:50:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-19 19:50:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 130. [2019-11-19 19:50:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-19 19:50:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2019-11-19 19:50:21,612 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 31 [2019-11-19 19:50:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:50:21,613 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2019-11-19 19:50:21,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:50:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2019-11-19 19:50:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 19:50:21,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:50:21,614 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:50:21,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:21,821 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:50:21,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:50:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash -786360053, now seen corresponding path program 1 times [2019-11-19 19:50:21,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:50:21,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1982843574] [2019-11-19 19:50:21,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:50:22,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 19:50:22,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:50:22,118 INFO L377 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 [2019-11-19 19:50:22,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:22,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:22,131 INFO L377 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 [2019-11-19 19:50:22,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:22,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:22,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:50:22,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 19:50:22,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:22,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-19 19:50:22,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:22,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:22,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-19 19:50:22,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:22,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:22,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:50:22,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-19 19:50:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:50:22,347 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:50:22,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:50:22,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 19:50:22,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:22,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:22,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:22,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:22,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:22,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:22,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:22,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:26,674 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-19 19:50:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:50:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:50:29,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1982843574] [2019-11-19 19:50:29,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:50:29,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-19 19:50:29,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035780388] [2019-11-19 19:50:29,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 19:50:29,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 19:50:29,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 19:50:29,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=201, Unknown=1, NotChecked=0, Total=240 [2019-11-19 19:50:29,736 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 16 states. [2019-11-19 19:50:35,987 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv1 1) (select |c_#valid| c_node_create_~temp~0.base)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32)) |c_#length|))) (= (bvadd (select |c_#length| c_node_create_~temp~0.base) (_ bv4294967288 32)) (_ bv0 32)) (forall ((v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_sll_circular_create_~last~0.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_node_create_#t~malloc2.base_31| (_ BitVec 32))) (let ((.cse0 (bvadd v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (bvsle v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 .cse0)) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (bvsle (bvadd v_sll_circular_create_~last~0.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_prenex_2 (_ bv8 32)) v_sll_circular_create_~last~0.base_BEFORE_CALL_4))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_2)))) (bvsle .cse0 (select (store |c_#length| |v_node_create_#t~malloc2.base_31| (_ bv8 32)) v_sll_circular_create_~last~0.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_sll_circular_create_~last~0.offset_BEFORE_CALL_2)) (not (= (select |c_#valid| |v_node_create_#t~malloc2.base_31|) (_ bv0 1)))))) (= (_ bv0 32) c_node_create_~temp~0.offset)) is different from false [2019-11-19 19:50:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:50:57,494 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-11-19 19:50:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:50:57,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-19 19:50:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:50:57,510 INFO L225 Difference]: With dead ends: 149 [2019-11-19 19:50:57,510 INFO L226 Difference]: Without dead ends: 149 [2019-11-19 19:50:57,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=74, Invalid=348, Unknown=2, NotChecked=38, Total=462 [2019-11-19 19:50:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-19 19:50:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2019-11-19 19:50:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-19 19:50:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2019-11-19 19:50:57,518 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 31 [2019-11-19 19:50:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:50:57,518 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2019-11-19 19:50:57,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 19:50:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2019-11-19 19:50:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-19 19:50:57,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:50:57,520 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:50:57,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:57,724 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_prependErr5REQUIRES_VIOLATION, sll_circular_prependErr16REQUIRES_VIOLATION, sll_circular_prependErr6REQUIRES_VIOLATION, sll_circular_prependErr7REQUIRES_VIOLATION, sll_circular_prependErr17REQUIRES_VIOLATION, sll_circular_prependErr2REQUIRES_VIOLATION, sll_circular_prependErr3REQUIRES_VIOLATION, sll_circular_prependErr13REQUIRES_VIOLATION, sll_circular_prependErr15REQUIRES_VIOLATION, sll_circular_prependErr14REQUIRES_VIOLATION, sll_circular_prependErr4REQUIRES_VIOLATION, sll_circular_prependErr11REQUIRES_VIOLATION, sll_circular_prependErr10REQUIRES_VIOLATION, sll_circular_prependErr0REQUIRES_VIOLATION, sll_circular_prependErr21REQUIRES_VIOLATION, sll_circular_prependErr1REQUIRES_VIOLATION, sll_circular_prependErr12REQUIRES_VIOLATION, sll_circular_prependErr8REQUIRES_VIOLATION, sll_circular_prependErr19REQUIRES_VIOLATION, sll_circular_prependErr18REQUIRES_VIOLATION, sll_circular_prependErr20REQUIRES_VIOLATION, sll_circular_prependErr9REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 19:50:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:50:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1603382588, now seen corresponding path program 1 times [2019-11-19 19:50:57,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 19:50:57,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1481856858] [2019-11-19 19:50:57,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:50:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:50:58,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 19:50:58,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:50:58,137 INFO L377 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 [2019-11-19 19:50:58,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:58,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:58,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:50:58,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 19:50:58,360 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-11-19 19:50:58,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 49 [2019-11-19 19:50:58,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:58,391 INFO L567 ElimStorePlain]: treesize reduction 17, result has 54.1 percent of original size [2019-11-19 19:50:58,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 19:50:58,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2019-11-19 19:50:58,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:50:58,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 50 [2019-11-19 19:50:58,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:50:58,552 INFO L567 ElimStorePlain]: treesize reduction 28, result has 41.7 percent of original size [2019-11-19 19:50:58,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 19:50:58,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-11-19 19:50:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 19:50:58,579 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 19:51:11,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 19:51:11,954 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-19 19:51:11,962 INFO L168 Benchmark]: Toolchain (without parser) took 76264.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -41.4 MB). Peak memory consumption was 263.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:51:11,962 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:51:11,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2019-11-19 19:51:11,963 INFO L168 Benchmark]: Boogie Preprocessor took 84.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:51:11,964 INFO L168 Benchmark]: RCFGBuilder took 1146.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.8 MB). Peak memory consumption was 72.8 MB. Max. memory is 11.5 GB. [2019-11-19 19:51:11,965 INFO L168 Benchmark]: TraceAbstraction took 74368.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 204.3 MB. Max. memory is 11.5 GB. [2019-11-19 19:51:11,973 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 658.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1146.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.8 MB). Peak memory consumption was 72.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74368.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 204.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...