./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer --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 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no XNF --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:56:55,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:55,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:55,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:55,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:55,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:55,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:55,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:55,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:55,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:55,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:55,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:55,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:55,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:55,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:55,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:55,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:55,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:55,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:55,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:56,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:56,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:56,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:56,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:56,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:56,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:56,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:56,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:56,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:56,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:56,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:56,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:56,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:56,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:56,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:56,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:56,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:56,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:56,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:56,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:56,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:56,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 08:56:56,042 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:56,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:56,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:56,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:56,043 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:56,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:56,044 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:56,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:56:56,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:56,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:56,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:56,045 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 08:56:56,045 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 08:56:56,045 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 08:56:56,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:56,045 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:56:56,045 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:56:56,046 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:56:56,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:56,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:56,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:56,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:56,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:56,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:56,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:56,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:56,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:56,047 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:56:56,048 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:56:56,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:56:56,048 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer 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 -> 8aeee5b79c4aa76b6157129a026e191e5e1fb5dc [2019-11-25 08:56:56,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:56,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:56,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:56,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:56,252 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:56,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-11-25 08:56:56,319 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/data/4a352f6bb/0ecc47d1667e4456828e4be4c35f1845/FLAG57bdbfa8d [2019-11-25 08:56:56,847 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:56,848 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2019-11-25 08:56:56,864 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/data/4a352f6bb/0ecc47d1667e4456828e4be4c35f1845/FLAG57bdbfa8d [2019-11-25 08:56:57,123 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/data/4a352f6bb/0ecc47d1667e4456828e4be4c35f1845 [2019-11-25 08:56:57,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:57,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 08:56:57,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:57,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:57,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:57,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c98e021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57, skipping insertion in model container [2019-11-25 08:56:57,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:57,198 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:57,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:57,641 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:57,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:57,775 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:57,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57 WrapperNode [2019-11-25 08:56:57,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:57,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:57,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:57,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:57,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... [2019-11-25 08:56:57,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:57,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:57,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:57,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:57,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:56:57,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 08:56:57,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:57,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 08:56:57,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 08:56:57,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 08:56:57,960 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-25 08:56:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-25 08:56:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 08:56:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 08:56:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 08:56:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 08:56:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 08:56:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 08:56:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 08:56:57,964 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 08:56:57,964 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 08:56:57,964 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 08:56:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 08:56:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 08:56:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 08:56:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 08:56:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 08:56:57,965 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 08:56:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 08:56:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 08:56:57,966 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 08:56:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 08:56:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 08:56:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 08:56:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 08:56:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 08:56:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 08:56:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 08:56:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 08:56:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 08:56:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 08:56:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 08:56:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 08:56:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 08:56:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 08:56:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 08:56:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 08:56:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 08:56:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 08:56:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 08:56:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 08:56:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 08:56:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 08:56:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 08:56:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 08:56:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 08:56:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 08:56:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 08:56:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 08:56:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 08:56:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 08:56:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 08:56:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 08:56:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 08:56:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 08:56:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 08:56:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 08:56:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 08:56:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 08:56:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 08:56:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 08:56:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 08:56:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 08:56:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 08:56:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 08:56:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 08:56:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 08:56:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-25 08:56:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-25 08:56:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:56:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:56:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 08:56:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 08:56:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 08:56:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:56:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:56:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 08:56:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 08:56:58,383 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-25 08:56:58,705 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:58,705 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-25 08:56:58,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:58 BoogieIcfgContainer [2019-11-25 08:56:58,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:58,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:58,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:58,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:58,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:57" (1/3) ... [2019-11-25 08:56:58,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50290a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:58, skipping insertion in model container [2019-11-25 08:56:58,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:57" (2/3) ... [2019-11-25 08:56:58,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50290a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:58, skipping insertion in model container [2019-11-25 08:56:58,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:58" (3/3) ... [2019-11-25 08:56:58,717 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2019-11-25 08:56:58,726 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:58,733 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2019-11-25 08:56:58,752 INFO L249 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2019-11-25 08:56:58,769 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:58,769 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 08:56:58,769 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:58,769 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:58,769 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:58,770 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:58,770 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:58,770 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-25 08:56:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:56:58,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:58,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:58,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:56:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1776621815, now seen corresponding path program 1 times [2019-11-25 08:56:58,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:58,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [990786000] [2019-11-25 08:56:58,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:56:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:59,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:56:59,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:59,076 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-25 08:56:59,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:59,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:59,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:59,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 08:56:59,092 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-25 08:56:59,092 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:59,106 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-25 08:56:59,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [990786000] [2019-11-25 08:56:59,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:59,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:56:59,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116979886] [2019-11-25 08:56:59,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:59,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:59,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:59,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:59,128 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-11-25 08:56:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:59,290 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-11-25 08:56:59,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:59,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 08:56:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:59,301 INFO L225 Difference]: With dead ends: 68 [2019-11-25 08:56:59,301 INFO L226 Difference]: Without dead ends: 60 [2019-11-25 08:56:59,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-25 08:56:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-25 08:56:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 08:56:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-25 08:56:59,358 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 10 [2019-11-25 08:56:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:59,360 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-25 08:56:59,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-25 08:56:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:56:59,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:59,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:59,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:56:59,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:56:59,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1776621816, now seen corresponding path program 1 times [2019-11-25 08:56:59,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:56:59,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1072679520] [2019-11-25 08:56:59,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:56:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:59,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:56:59,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:59,765 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-25 08:56:59,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:56:59,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:56:59,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:56:59,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:56:59,785 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-25 08:56:59,785 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:56:59,829 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-25 08:56:59,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072679520] [2019-11-25 08:56:59,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:59,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 08:56:59,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168681474] [2019-11-25 08:56:59,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:59,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:56:59,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:59,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:59,833 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 4 states. [2019-11-25 08:57:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:00,036 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-25 08:57:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:00,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 08:57:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:00,038 INFO L225 Difference]: With dead ends: 57 [2019-11-25 08:57:00,038 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 08:57:00,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 08:57:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 08:57:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 08:57:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-25 08:57:00,046 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 10 [2019-11-25 08:57:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:00,046 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-25 08:57:00,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-25 08:57:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:57:00,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:00,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:00,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:00,251 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:00,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1685663133, now seen corresponding path program 1 times [2019-11-25 08:57:00,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:00,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1042170825] [2019-11-25 08:57:00,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:57:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:00,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:57:00,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:00,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:00,514 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-25 08:57:00,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:00,545 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-25 08:57:00,546 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-25 08:57:00,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-25 08:57:00,561 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-25 08:57:00,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:00,571 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-25 08:57:00,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1042170825] [2019-11-25 08:57:00,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:00,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-25 08:57:00,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197172899] [2019-11-25 08:57:00,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:00,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:00,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:00,574 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 4 states. [2019-11-25 08:57:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:00,771 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-11-25 08:57:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:00,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 08:57:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:00,775 INFO L225 Difference]: With dead ends: 63 [2019-11-25 08:57:00,775 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 08:57:00,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-25 08:57:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 08:57:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2019-11-25 08:57:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 08:57:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-25 08:57:00,787 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 15 [2019-11-25 08:57:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:00,788 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-25 08:57:00,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-25 08:57:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:57:00,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:00,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:01,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:01,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1685663132, now seen corresponding path program 1 times [2019-11-25 08:57:01,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:01,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1796454715] [2019-11-25 08:57:01,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:57:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:01,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:57:01,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:01,228 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-25 08:57:01,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:01,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:01,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:01,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:57:01,268 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-25 08:57:01,268 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:01,304 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-25 08:57:01,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1796454715] [2019-11-25 08:57:01,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:01,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 08:57:01,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658194223] [2019-11-25 08:57:01,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:01,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:01,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:01,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:01,306 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2019-11-25 08:57:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:01,496 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-25 08:57:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:01,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 08:57:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:01,499 INFO L225 Difference]: With dead ends: 58 [2019-11-25 08:57:01,499 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 08:57:01,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-25 08:57:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 08:57:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-11-25 08:57:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:57:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-11-25 08:57:01,504 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 15 [2019-11-25 08:57:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:01,505 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-11-25 08:57:01,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-11-25 08:57:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:57:01,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:01,506 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-25 08:57:01,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:01,715 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1462049621, now seen corresponding path program 1 times [2019-11-25 08:57:01,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:01,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1640685647] [2019-11-25 08:57:01,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:57:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:01,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:57:01,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:01,926 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-25 08:57:01,926 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:01,987 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-25 08:57:01,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1640685647] [2019-11-25 08:57:01,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:01,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-25 08:57:01,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328267353] [2019-11-25 08:57:01,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:57:01,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:01,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:57:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:01,989 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 7 states. [2019-11-25 08:57:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:02,034 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-25 08:57:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:57:02,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-25 08:57:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:02,036 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:57:02,036 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 08:57:02,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:57:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 08:57:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-11-25 08:57:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 08:57:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-25 08:57:02,042 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 19 [2019-11-25 08:57:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:02,043 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-25 08:57:02,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:57:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-25 08:57:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:57:02,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:02,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:02,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:02,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2055862817, now seen corresponding path program 1 times [2019-11-25 08:57:02,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:02,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1108208639] [2019-11-25 08:57:02,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:57:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:02,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:57:02,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:02,525 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:02,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1108208639] [2019-11-25 08:57:02,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:02,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-25 08:57:02,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530253818] [2019-11-25 08:57:02,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:57:02,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:57:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:02,683 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 9 states. [2019-11-25 08:57:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:02,849 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-11-25 08:57:02,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:57:02,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-25 08:57:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:02,854 INFO L225 Difference]: With dead ends: 67 [2019-11-25 08:57:02,854 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 08:57:02,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:57:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 08:57:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-25 08:57:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 08:57:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-11-25 08:57:02,865 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 24 [2019-11-25 08:57:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:02,865 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-11-25 08:57:02,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:57:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-11-25 08:57:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:57:02,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:02,867 INFO L410 BasicCegarLoop]: trace histogram [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-25 08:57:03,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:03,068 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash -94141141, now seen corresponding path program 2 times [2019-11-25 08:57:03,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:03,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2076224235] [2019-11-25 08:57:03,069 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:57:03,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:57:03,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:57:03,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:57:03,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:03,378 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:03,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2076224235] [2019-11-25 08:57:03,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:03,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-25 08:57:03,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634609515] [2019-11-25 08:57:03,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 08:57:03,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:03,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:57:03,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:57:03,560 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 11 states. [2019-11-25 08:57:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:03,783 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-11-25 08:57:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:57:03,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-11-25 08:57:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:03,784 INFO L225 Difference]: With dead ends: 72 [2019-11-25 08:57:03,785 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 08:57:03,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:57:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 08:57:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-11-25 08:57:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 08:57:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-25 08:57:03,791 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 29 [2019-11-25 08:57:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:03,792 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-25 08:57:03,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 08:57:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-25 08:57:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:57:03,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:03,793 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:03,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:03,995 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:03,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:03,996 INFO L82 PathProgramCache]: Analyzing trace with hash -893536929, now seen corresponding path program 3 times [2019-11-25 08:57:03,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:03,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1630987067] [2019-11-25 08:57:03,996 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/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-25 08:57:04,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-25 08:57:04,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:57:04,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:57:04,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:57:04,222 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:57:04,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1630987067] [2019-11-25 08:57:04,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:04,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-25 08:57:04,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307630503] [2019-11-25 08:57:04,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:57:04,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:57:04,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:04,296 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 7 states. [2019-11-25 08:57:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:04,746 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-25 08:57:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:57:04,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-25 08:57:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:04,748 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:57:04,748 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 08:57:04,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 08:57:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-25 08:57:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:57:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-25 08:57:04,753 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2019-11-25 08:57:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:04,754 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-25 08:57:04,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:57:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-25 08:57:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:57:04,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:04,755 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:04,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:04,957 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash -893536928, now seen corresponding path program 1 times [2019-11-25 08:57:04,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:04,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1837641967] [2019-11-25 08:57:04,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:05,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:57:05,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:05,288 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:05,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1837641967] [2019-11-25 08:57:05,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:05,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-25 08:57:05,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381050070] [2019-11-25 08:57:05,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:57:05,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:05,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:57:05,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:57:05,529 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 13 states. [2019-11-25 08:57:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:05,865 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-11-25 08:57:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:57:05,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-25 08:57:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:05,867 INFO L225 Difference]: With dead ends: 74 [2019-11-25 08:57:05,867 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 08:57:05,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:57:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 08:57:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-25 08:57:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:57:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-25 08:57:05,872 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 34 [2019-11-25 08:57:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:05,873 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-25 08:57:05,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:57:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-25 08:57:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:57:05,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:05,874 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:06,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:06,077 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1677559212, now seen corresponding path program 2 times [2019-11-25 08:57:06,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:06,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1927160004] [2019-11-25 08:57:06,078 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:06,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:57:06,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:57:06,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 08:57:06,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:06,366 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-25 08:57:06,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:06,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:06,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:06,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:57:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-25 08:57:06,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-25 08:57:06,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1927160004] [2019-11-25 08:57:06,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:06,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-25 08:57:06,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967851890] [2019-11-25 08:57:06,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:57:06,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:06,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:57:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:57:06,893 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 12 states. [2019-11-25 08:57:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:07,644 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-11-25 08:57:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:57:07,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-25 08:57:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:07,645 INFO L225 Difference]: With dead ends: 69 [2019-11-25 08:57:07,646 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 08:57:07,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:57:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 08:57:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-25 08:57:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:57:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-25 08:57:07,650 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 39 [2019-11-25 08:57:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:07,650 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-25 08:57:07,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:57:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-25 08:57:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:57:07,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:07,654 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:07,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:07,857 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:07,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:07,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1114696837, now seen corresponding path program 1 times [2019-11-25 08:57:07,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:07,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1661200189] [2019-11-25 08:57:07,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:08,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-25 08:57:08,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:08,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-25 08:57:08,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-25 08:57:08,249 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-25 08:57:08,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:57:08,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,308 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-25 08:57:08,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,341 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-25 08:57:08,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:17 [2019-11-25 08:57:08,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:57:08,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2019-11-25 08:57:08,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:08,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-25 08:57:08,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-25 08:57:08,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2019-11-25 08:57:08,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,478 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:08,510 INFO L567 ElimStorePlain]: treesize reduction 12, result has 75.0 percent of original size [2019-11-25 08:57:08,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:08,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:36 [2019-11-25 08:57:08,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:08,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-25 08:57:08,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:08,743 INFO L567 ElimStorePlain]: treesize reduction 12, result has 69.2 percent of original size [2019-11-25 08:57:08,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:08,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:27 [2019-11-25 08:57:08,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2019-11-25 08:57:08,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,766 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:08,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:08,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:08,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-11-25 08:57:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:57:08,835 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:08,898 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:08,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:08,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:08,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-11-25 08:57:09,139 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-25 08:57:09,249 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 08:57:09,453 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-25 08:57:09,651 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:09,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:09,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:09,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2019-11-25 08:57:09,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:09,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:09,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:09,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:28 [2019-11-25 08:57:09,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:09,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:10,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:10,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:10,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:10,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-11-25 08:57:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:57:10,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1661200189] [2019-11-25 08:57:10,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:10,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-25 08:57:10,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069442320] [2019-11-25 08:57:10,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 08:57:10,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 08:57:10,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-11-25 08:57:10,032 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 23 states. [2019-11-25 08:57:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:11,801 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-25 08:57:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:57:11,801 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-25 08:57:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:11,802 INFO L225 Difference]: With dead ends: 75 [2019-11-25 08:57:11,802 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 08:57:11,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-11-25 08:57:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 08:57:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-25 08:57:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 08:57:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-25 08:57:11,808 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 45 [2019-11-25 08:57:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:11,809 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-25 08:57:11,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 08:57:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-25 08:57:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:57:11,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:11,811 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:12,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:12,014 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:57:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1114696836, now seen corresponding path program 1 times [2019-11-25 08:57:12,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:12,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1088396322] [2019-11-25 08:57:12,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_438132e5-3296-4e39-af29-39793b325883/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:12,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-25 08:57:12,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:12,437 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-25 08:57:12,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,449 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-25 08:57:12,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-25 08:57:12,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:12,497 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 14 treesize of output 16 [2019-11-25 08:57:12,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,524 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-25 08:57:12,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:26 [2019-11-25 08:57:12,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:57:12,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:57:12,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:36 [2019-11-25 08:57:12,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:12,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-11-25 08:57:12,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:12,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-25 08:57:12,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:38 [2019-11-25 08:57:12,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 42 [2019-11-25 08:57:12,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:12,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:12,784 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:12,839 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.9 percent of original size [2019-11-25 08:57:12,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:12,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-25 08:57:12,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:12,916 INFO L567 ElimStorePlain]: treesize reduction 16, result has 77.1 percent of original size [2019-11-25 08:57:12,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:12,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:12,918 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-11-25 08:57:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:12,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:13,120 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-11-25 08:57:13,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:13,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:13,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:13,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2019-11-25 08:57:13,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:13,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:13,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 88 [2019-11-25 08:57:13,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:13,645 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-25 08:57:13,646 INFO L567 ElimStorePlain]: treesize reduction 26, result has 83.8 percent of original size [2019-11-25 08:57:13,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:13,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-25 08:57:13,668 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:13,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:13,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:13,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 65 [2019-11-25 08:57:13,691 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:13,800 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-25 08:57:13,801 INFO L567 ElimStorePlain]: treesize reduction 16, result has 85.7 percent of original size [2019-11-25 08:57:13,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-25 08:57:13,802 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:176, output treesize:96 [2019-11-25 08:57:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:13,853 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 5=[v_prenex_1, v_prenex_2]} [2019-11-25 08:57:13,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:57:13,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-25 08:57:13,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:13,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:13,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:13,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2019-11-25 08:57:13,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:14,034 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.7 percent of original size [2019-11-25 08:57:14,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:14,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 55 [2019-11-25 08:57:14,055 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:14,169 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-11-25 08:57:14,169 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2019-11-25 08:57:14,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-11-25 08:57:14,178 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:14,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:14,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-25 08:57:14,214 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:116, output treesize:48 [2019-11-25 08:57:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:57:14,430 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:57:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:57:14,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:14,836 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:14,850 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:14,862 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:14,868 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:14,873 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:14,975 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-25 08:57:14,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:14,983 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:14,994 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:15,001 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:15,010 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:15,016 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:15,020 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:15,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:15,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-25 08:57:15,074 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:367, output treesize:207 [2019-11-25 08:57:16,024 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-25 08:57:16,280 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-25 08:57:16,506 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-25 08:57:16,732 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-25 08:57:17,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:57:17,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:17,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:17,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:17,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,645 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:17,654 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:17,676 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,695 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:17,710 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:18,280 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-25 08:57:18,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,296 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:18,306 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:18,318 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:18,340 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:18,357 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:18,415 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:19,603 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 122 [2019-11-25 08:57:19,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:19,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-25 08:57:19,604 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:495, output treesize:575 [2019-11-25 08:57:20,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:20,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:57:20,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:57:20,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:20,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:20,565 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:20,575 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:20,938 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-25 08:57:20,939 INFO L567 ElimStorePlain]: treesize reduction 84, result has 84.0 percent of original size [2019-11-25 08:57:20,948 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:20,958 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:21,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:21,159 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) 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-25 08:57:21,162 INFO L168 Benchmark]: Toolchain (without parser) took 24035.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 946.1 MB in the beginning and 911.5 MB in the end (delta: 34.6 MB). Peak memory consumption was 244.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:21,162 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:57:21,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:21,163 INFO L168 Benchmark]: Boogie Preprocessor took 117.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:21,163 INFO L168 Benchmark]: RCFGBuilder took 812.71 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:21,163 INFO L168 Benchmark]: TraceAbstraction took 22453.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 911.5 MB in the end (delta: 137.1 MB). Peak memory consumption was 215.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:21,165 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 812.71 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22453.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 911.5 MB in the end (delta: 137.1 MB). Peak memory consumption was 215.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...