./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_search-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b9ae191666cff52a5646f600ca779e3fb8cdedc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:49:18,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:49:18,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:49:18,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:49:18,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:49:18,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:49:18,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:49:19,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:49:19,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:49:19,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:49:19,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:49:19,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:49:19,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:49:19,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:49:19,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:49:19,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:49:19,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:49:19,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:49:19,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:49:19,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:49:19,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:49:19,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:49:19,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:49:19,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:49:19,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:49:19,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:49:19,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:49:19,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:49:19,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:49:19,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:49:19,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:49:19,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:49:19,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:49:19,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:49:19,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:49:19,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:49:19,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:49:19,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:49:19,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:49:19,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:49:19,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:49:19,045 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2019-11-26 02:49:19,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:49:19,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:49:19,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:49:19,059 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:49:19,059 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:49:19,059 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:49:19,060 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:49:19,060 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:49:19,060 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:49:19,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:49:19,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:49:19,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:49:19,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:49:19,062 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:49:19,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:49:19,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:49:19,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:49:19,063 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:49:19,063 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:49:19,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:49:19,063 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:49:19,064 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:49:19,064 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:49:19,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:49:19,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:49:19,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:49:19,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:49:19,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:49:19,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:49:19,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:49:19,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:49:19,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:49:19,067 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:49:19,067 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:49:19,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:49:19,068 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_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 8b9ae191666cff52a5646f600ca779e3fb8cdedc [2019-11-26 02:49:19,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:49:19,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:49:19,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:49:19,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:49:19,220 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:49:19,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/../../sv-benchmarks/c/list-properties/list_search-1.i [2019-11-26 02:49:19,272 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/data/e62c0316f/c0b9af4f85bb4dd79c15a546776ee812/FLAGd146db9e1 [2019-11-26 02:49:19,789 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:49:19,790 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-26 02:49:19,803 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/data/e62c0316f/c0b9af4f85bb4dd79c15a546776ee812/FLAGd146db9e1 [2019-11-26 02:49:20,289 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/data/e62c0316f/c0b9af4f85bb4dd79c15a546776ee812 [2019-11-26 02:49:20,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:49:20,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:49:20,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:49:20,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:49:20,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:49:20,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e675d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20, skipping insertion in model container [2019-11-26 02:49:20,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:49:20,351 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:49:20,655 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:49:20,656 INFO L968 CHandler]: at location: C: (mlist*)malloc(sizeof(mlist)) [531] [2019-11-26 02:49:20,656 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:49:20,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:49:20,676 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 02:49:20,686 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:49:20,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:49:20,722 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:49:20,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:49:20,829 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:49:20,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20 WrapperNode [2019-11-26 02:49:20,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:49:20,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:49:20,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:49:20,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:49:20,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:49:20,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:49:20,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:49:20,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:49:20,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... [2019-11-26 02:49:20,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:49:20,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:49:20,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:49:20,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:49:20,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:49:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:49:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:49:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:49:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:49:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:49:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:49:21,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:49:21,752 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:49:21,752 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-26 02:49:21,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:49:21 BoogieIcfgContainer [2019-11-26 02:49:21,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:49:21,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:49:21,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:49:21,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:49:21,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:49:20" (1/3) ... [2019-11-26 02:49:21,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54437e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:49:21, skipping insertion in model container [2019-11-26 02:49:21,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:49:20" (2/3) ... [2019-11-26 02:49:21,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54437e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:49:21, skipping insertion in model container [2019-11-26 02:49:21,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:49:21" (3/3) ... [2019-11-26 02:49:21,763 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-26 02:49:21,772 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:49:21,779 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-11-26 02:49:21,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-11-26 02:49:21,808 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:49:21,809 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:49:21,809 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:49:21,809 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:49:21,809 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:49:21,809 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:49:21,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:49:21,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:49:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2019-11-26 02:49:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 02:49:21,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:21,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 02:49:21,842 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-11-26 02:49:21,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:21,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [461063119] [2019-11-26 02:49:21,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:21,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:49:21,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:22,019 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-26 02:49:22,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:22,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:22,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:22,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:49:22,032 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-26 02:49:22,032 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:22,036 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-26 02:49:22,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [461063119] [2019-11-26 02:49:22,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:22,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:49:22,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240645309] [2019-11-26 02:49:22,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:49:22,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:49:22,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:22,058 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2019-11-26 02:49:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:22,416 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2019-11-26 02:49:22,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:22,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-26 02:49:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:22,437 INFO L225 Difference]: With dead ends: 96 [2019-11-26 02:49:22,437 INFO L226 Difference]: Without dead ends: 91 [2019-11-26 02:49:22,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:49:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-26 02:49:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2019-11-26 02:49:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 02:49:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-11-26 02:49:22,495 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 3 [2019-11-26 02:49:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:22,495 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-11-26 02:49:22,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:49:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-11-26 02:49:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 02:49:22,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:22,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 02:49:22,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:22,699 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-26 02:49:22,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:22,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1383406515] [2019-11-26 02:49:22,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:22,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:49:22,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:22,807 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-26 02:49:22,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:22,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:22,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:22,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:49:22,830 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-26 02:49:22,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:22,879 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-26 02:49:22,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1383406515] [2019-11-26 02:49:22,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:22,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:49:22,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595029974] [2019-11-26 02:49:22,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:49:22,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:49:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:49:22,883 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 4 states. [2019-11-26 02:49:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:23,207 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-26 02:49:23,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:49:23,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-26 02:49:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:23,210 INFO L225 Difference]: With dead ends: 62 [2019-11-26 02:49:23,210 INFO L226 Difference]: Without dead ends: 62 [2019-11-26 02:49:23,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 02:49:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-26 02:49:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-26 02:49:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-26 02:49:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-26 02:49:23,226 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 3 [2019-11-26 02:49:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:23,226 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-26 02:49:23,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:49:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-26 02:49:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:49:23,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:23,237 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, 1] [2019-11-26 02:49:23,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:23,438 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1459663056, now seen corresponding path program 1 times [2019-11-26 02:49:23,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:23,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2081655596] [2019-11-26 02:49:23,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:23,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:49:23,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:23,637 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-26 02:49:23,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:23,643 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-26 02:49:23,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2081655596] [2019-11-26 02:49:23,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:23,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:49:23,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168772135] [2019-11-26 02:49:23,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:49:23,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:49:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:49:23,651 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2019-11-26 02:49:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:23,946 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-26 02:49:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:49:23,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-26 02:49:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:23,950 INFO L225 Difference]: With dead ends: 69 [2019-11-26 02:49:23,950 INFO L226 Difference]: Without dead ends: 69 [2019-11-26 02:49:23,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:49:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-26 02:49:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-26 02:49:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-26 02:49:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-11-26 02:49:23,969 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 25 [2019-11-26 02:49:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:23,970 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-11-26 02:49:23,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:49:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-11-26 02:49:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:49:23,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:23,972 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, 1, 1, 1, 1] [2019-11-26 02:49:24,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:24,174 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2136563859, now seen corresponding path program 1 times [2019-11-26 02:49:24,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:24,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [434781644] [2019-11-26 02:49:24,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:24,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:49:24,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:24,496 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-26 02:49:24,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:24,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:24,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:24,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:49:24,529 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-26 02:49:24,529 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:24,545 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-26 02:49:24,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [434781644] [2019-11-26 02:49:24,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:24,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:49:24,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561998738] [2019-11-26 02:49:24,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:49:24,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:24,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:49:24,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:49:24,557 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2019-11-26 02:49:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:24,999 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-11-26 02:49:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:49:24,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-26 02:49:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:25,001 INFO L225 Difference]: With dead ends: 91 [2019-11-26 02:49:25,001 INFO L226 Difference]: Without dead ends: 91 [2019-11-26 02:49:25,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:49:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-26 02:49:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2019-11-26 02:49:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 02:49:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-11-26 02:49:25,010 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 28 [2019-11-26 02:49:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:25,010 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-11-26 02:49:25,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:49:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-11-26 02:49:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:49:25,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:25,012 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, 1, 1, 1, 1] [2019-11-26 02:49:25,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:25,215 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2136563858, now seen corresponding path program 1 times [2019-11-26 02:49:25,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:25,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1884330777] [2019-11-26 02:49:25,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:25,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:49:25,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:25,518 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-26 02:49:25,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:25,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:25,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:25,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:49:25,560 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-26 02:49:25,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:25,719 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-26 02:49:25,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1884330777] [2019-11-26 02:49:25,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:25,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-26 02:49:25,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53921807] [2019-11-26 02:49:25,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:49:25,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:25,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:49:25,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:49:25,721 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 8 states. [2019-11-26 02:49:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:26,505 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2019-11-26 02:49:26,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:49:26,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-26 02:49:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:26,507 INFO L225 Difference]: With dead ends: 130 [2019-11-26 02:49:26,508 INFO L226 Difference]: Without dead ends: 130 [2019-11-26 02:49:26,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:49:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-26 02:49:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 70. [2019-11-26 02:49:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:49:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-11-26 02:49:26,514 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 28 [2019-11-26 02:49:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:26,514 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-11-26 02:49:26,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:49:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-11-26 02:49:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 02:49:26,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:26,515 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:26,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:26,719 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1047295973, now seen corresponding path program 1 times [2019-11-26 02:49:26,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:26,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [963056397] [2019-11-26 02:49:26,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:26,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:49:26,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:26,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:26,952 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-26 02:49:26,952 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:26,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:26,958 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-26 02:49:26,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [963056397] [2019-11-26 02:49:26,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:26,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-26 02:49:26,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144537088] [2019-11-26 02:49:26,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:49:26,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:49:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:49:26,959 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 6 states. [2019-11-26 02:49:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:27,315 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-26 02:49:27,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:49:27,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-26 02:49:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:27,316 INFO L225 Difference]: With dead ends: 101 [2019-11-26 02:49:27,316 INFO L226 Difference]: Without dead ends: 101 [2019-11-26 02:49:27,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:49:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-26 02:49:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2019-11-26 02:49:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:49:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-11-26 02:49:27,323 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 31 [2019-11-26 02:49:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:27,323 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-11-26 02:49:27,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:49:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-11-26 02:49:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 02:49:27,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:27,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:27,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:27,528 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash 126231682, now seen corresponding path program 1 times [2019-11-26 02:49:27,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:27,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1059469774] [2019-11-26 02:49:27,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:27,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:49:27,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:27,745 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-26 02:49:27,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:27,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:27,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:27,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:49:27,781 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-26 02:49:27,782 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:27,787 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-26 02:49:27,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059469774] [2019-11-26 02:49:27,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:27,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-26 02:49:27,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668698078] [2019-11-26 02:49:27,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:49:27,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:49:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:49:27,788 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2019-11-26 02:49:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:28,325 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-11-26 02:49:28,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:49:28,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-26 02:49:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:28,327 INFO L225 Difference]: With dead ends: 88 [2019-11-26 02:49:28,327 INFO L226 Difference]: Without dead ends: 88 [2019-11-26 02:49:28,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:49:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-26 02:49:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2019-11-26 02:49:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:49:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2019-11-26 02:49:28,340 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 33 [2019-11-26 02:49:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:28,340 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2019-11-26 02:49:28,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:49:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2019-11-26 02:49:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 02:49:28,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:28,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:28,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:28,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash 126231683, now seen corresponding path program 1 times [2019-11-26 02:49:28,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:28,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [515099321] [2019-11-26 02:49:28,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:28,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 02:49:28,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:28,821 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-26 02:49:28,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:28,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:28,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:28,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:49:28,899 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-26 02:49:28,899 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:29,132 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-26 02:49:29,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [515099321] [2019-11-26 02:49:29,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:29,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-26 02:49:29,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786264555] [2019-11-26 02:49:29,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:49:29,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:49:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:49:29,133 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 12 states. [2019-11-26 02:49:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:30,611 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2019-11-26 02:49:30,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 02:49:30,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-26 02:49:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:30,614 INFO L225 Difference]: With dead ends: 126 [2019-11-26 02:49:30,614 INFO L226 Difference]: Without dead ends: 126 [2019-11-26 02:49:30,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:49:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-26 02:49:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 73. [2019-11-26 02:49:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 02:49:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-11-26 02:49:30,619 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 33 [2019-11-26 02:49:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:30,619 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-11-26 02:49:30,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:49:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-11-26 02:49:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:49:30,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:30,620 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:30,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:30,825 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:30,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1100154086, now seen corresponding path program 1 times [2019-11-26 02:49:30,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:30,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [485707234] [2019-11-26 02:49:30,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:31,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 02:49:31,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:31,098 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-26 02:49:31,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:31,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:49:31,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:31,138 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-26 02:49:31,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,159 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-26 02:49:31,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2019-11-26 02:49:31,179 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 13 treesize of output 9 [2019-11-26 02:49:31,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:31,189 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-26 02:49:31,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-26 02:49:31,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-26 02:49:31,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:31,265 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-26 02:49:31,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-26 02:49:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:31,328 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:31,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [485707234] [2019-11-26 02:49:31,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795629786] [2019-11-26 02:49:31,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:49:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:31,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-26 02:49:31,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:31,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:31,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-26 02:49:31,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,625 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-26 02:49:31,626 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-26 02:49:31,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-11-26 02:49:31,707 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 13 treesize of output 9 [2019-11-26 02:49:31,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,749 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-26 02:49:31,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:31,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2019-11-26 02:49:31,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-26 02:49:31,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:31,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:31,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:31,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:15 [2019-11-26 02:49:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:32,082 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:32,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:49:32,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 10] total 25 [2019-11-26 02:49:32,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434156739] [2019-11-26 02:49:32,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-26 02:49:32,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-26 02:49:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-11-26 02:49:32,416 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 26 states. [2019-11-26 02:49:33,625 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-11-26 02:49:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:34,302 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-26 02:49:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:49:34,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2019-11-26 02:49:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:34,305 INFO L225 Difference]: With dead ends: 112 [2019-11-26 02:49:34,305 INFO L226 Difference]: Without dead ends: 112 [2019-11-26 02:49:34,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 02:49:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-26 02:49:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2019-11-26 02:49:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-26 02:49:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-11-26 02:49:34,314 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 35 [2019-11-26 02:49:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:34,314 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-11-26 02:49:34,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-26 02:49:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-11-26 02:49:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:49:34,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:34,316 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:34,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:49:34,721 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:34,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1100154087, now seen corresponding path program 1 times [2019-11-26 02:49:34,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:34,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [162619019] [2019-11-26 02:49:34,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/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-26 02:49:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:35,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 02:49:35,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:35,089 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-26 02:49:35,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,111 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-26 02:49:35,111 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-26 02:49:35,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,155 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-26 02:49:35,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,175 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-26 02:49:35,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2019-11-26 02:49:35,215 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 13 treesize of output 9 [2019-11-26 02:49:35,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,235 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 13 treesize of output 9 [2019-11-26 02:49:35,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,248 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-26 02:49:35,249 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-26 02:49:35,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-26 02:49:35,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 02:49:35,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:35,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:35,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:35,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2019-11-26 02:49:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:35,462 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:49:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:36,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [162619019] [2019-11-26 02:49:36,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008738725] [2019-11-26 02:49:36,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:49:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:36,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-26 02:49:36,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:36,500 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-26 02:49:36,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:36,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:36,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:36,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:49:36,581 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:36,581 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-26 02:49:36,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:36,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:36,596 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-26 02:49:36,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:36,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:36,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:36,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-26 02:49:36,721 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 13 treesize of output 9 [2019-11-26 02:49:36,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:36,774 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.9 percent of original size [2019-11-26 02:49:36,778 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 13 treesize of output 9 [2019-11-26 02:49:36,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:36,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:36,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:36,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:39 [2019-11-26 02:49:37,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-26 02:49:37,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:37,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:37,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 02:49:37,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:37,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:37,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:37,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:20 [2019-11-26 02:49:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:37,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:37,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:49:37,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:49:38,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:38,008 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 22 treesize of output 26 [2019-11-26 02:49:38,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:38,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:38,020 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 27 treesize of output 31 [2019-11-26 02:49:38,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:38,067 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-11-26 02:49:38,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-26 02:49:38,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:24 [2019-11-26 02:49:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:38,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:49:38,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10, 11] total 28 [2019-11-26 02:49:38,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479620006] [2019-11-26 02:49:38,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-26 02:49:38,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-26 02:49:38,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2019-11-26 02:49:38,216 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 29 states. [2019-11-26 02:49:39,929 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-26 02:49:40,115 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-26 02:49:40,664 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-26 02:49:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:41,437 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2019-11-26 02:49:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 02:49:41,438 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-11-26 02:49:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:41,439 INFO L225 Difference]: With dead ends: 164 [2019-11-26 02:49:41,439 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 02:49:41,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2019-11-26 02:49:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 02:49:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 81. [2019-11-26 02:49:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-26 02:49:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-11-26 02:49:41,444 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 35 [2019-11-26 02:49:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:41,444 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-11-26 02:49:41,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-26 02:49:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-11-26 02:49:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 02:49:41,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:41,445 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:41,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:49:41,851 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -199167028, now seen corresponding path program 1 times [2019-11-26 02:49:41,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:41,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1675104215] [2019-11-26 02:49:41,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:42,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 02:49:42,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:42,052 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 13 treesize of output 9 [2019-11-26 02:49:42,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:42,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:42,061 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-26 02:49:42,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-26 02:49:42,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-26 02:49:42,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:42,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:42,104 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-26 02:49:42,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-26 02:49:42,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:42,138 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:42,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:42,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1675104215] [2019-11-26 02:49:42,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146873851] [2019-11-26 02:49:42,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:49:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:42,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-26 02:49:42,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:42,334 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 13 treesize of output 9 [2019-11-26 02:49:42,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:42,353 INFO L567 ElimStorePlain]: treesize reduction 5, result has 77.3 percent of original size [2019-11-26 02:49:42,353 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-26 02:49:42,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-11-26 02:49:42,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-26 02:49:42,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:42,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:42,382 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-26 02:49:42,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-26 02:49:42,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:42,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:42,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:42,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:49:42,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 12] total 19 [2019-11-26 02:49:42,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747745486] [2019-11-26 02:49:42,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 02:49:42,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 02:49:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:49:42,563 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states. [2019-11-26 02:49:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:43,806 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2019-11-26 02:49:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 02:49:43,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-11-26 02:49:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:43,807 INFO L225 Difference]: With dead ends: 134 [2019-11-26 02:49:43,807 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 02:49:43,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=781, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 02:49:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 02:49:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2019-11-26 02:49:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 02:49:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-11-26 02:49:43,812 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 38 [2019-11-26 02:49:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:43,812 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-11-26 02:49:43,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 02:49:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-11-26 02:49:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-26 02:49:43,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:43,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:44,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:49:44,217 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1294013429, now seen corresponding path program 1 times [2019-11-26 02:49:44,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:44,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1340270420] [2019-11-26 02:49:44,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:49:44,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-26 02:49:44,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:44,514 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 19 treesize of output 1 [2019-11-26 02:49:44,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:44,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:44,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:44,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:3 [2019-11-26 02:49:44,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:44,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 21 [2019-11-26 02:49:44,660 INFO L496 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:44,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:44,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-26 02:49:44,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:21 [2019-11-26 02:49:44,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:44,743 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-26 02:49:44,743 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:44,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:45,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:45,181 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-26 02:49:45,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1340270420] [2019-11-26 02:49:45,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:49:45,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 19 [2019-11-26 02:49:45,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560350260] [2019-11-26 02:49:45,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 02:49:45,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:49:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 02:49:45,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:49:45,183 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 19 states. [2019-11-26 02:49:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:49:47,473 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-11-26 02:49:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-26 02:49:47,474 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-11-26 02:49:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:49:47,475 INFO L225 Difference]: With dead ends: 91 [2019-11-26 02:49:47,475 INFO L226 Difference]: Without dead ends: 81 [2019-11-26 02:49:47,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=354, Invalid=1052, Unknown=0, NotChecked=0, Total=1406 [2019-11-26 02:49:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-26 02:49:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-11-26 02:49:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 02:49:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-11-26 02:49:47,478 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 41 [2019-11-26 02:49:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:49:47,478 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-11-26 02:49:47,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 02:49:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-11-26 02:49:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:49:47,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:49:47,479 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:49:47,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:47,680 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-11-26 02:49:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:49:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash -817285811, now seen corresponding path program 2 times [2019-11-26 02:49:47,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:49:47,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [657848888] [2019-11-26 02:49:47,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_24011578-bfb7-4396-97b6-b178f587b36f/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:48,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:49:48,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:49:48,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-26 02:49:48,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:49:48,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:48,296 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 12 treesize of output 28 [2019-11-26 02:49:48,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,308 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-26 02:49:48,309 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-26 02:49:48,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-26 02:49:48,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:48,333 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-26 02:49:48,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,349 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-26 02:49:48,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2019-11-26 02:49:48,371 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 13 treesize of output 9 [2019-11-26 02:49:48,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:48,403 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-26 02:49:48,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-26 02:49:48,612 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-26 02:49:48,613 INFO L343 Elim1Store]: treesize reduction 14, result has 85.9 percent of original size [2019-11-26 02:49:48,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 103 [2019-11-26 02:49:48,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,683 INFO L567 ElimStorePlain]: treesize reduction 46, result has 47.7 percent of original size [2019-11-26 02:49:48,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2019-11-26 02:49:48,741 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 41 treesize of output 34 [2019-11-26 02:49:48,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:48,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-11-26 02:49:48,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:48,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:48,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:48,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2019-11-26 02:49:48,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:48,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:49:48,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2019-11-26 02:49:48,969 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_96|], 20=[|v_#memory_$Pointer$.base_103|]} [2019-11-26 02:49:48,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-26 02:49:48,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:49,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:49,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:49,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:49,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:49,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:49,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:49,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:49:49,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2019-11-26 02:49:49,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:49,165 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.1 percent of original size [2019-11-26 02:49:49,165 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-26 02:49:49,165 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:86 [2019-11-26 02:49:49,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 02:49:49,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:49:49,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:49,397 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-26 02:49:49,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:76 [2019-11-26 02:49:49,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:49,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 39 [2019-11-26 02:49:49,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:49,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:49:49,494 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-26 02:49:49,531 INFO L567 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2019-11-26 02:49:49,532 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-26 02:49:49,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:24 [2019-11-26 02:49:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:49:49,634 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:49:49,999 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-26 02:49:50,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:49:50,013 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-26 02:49:50,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:42 [2019-11-26 02:49:50,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:49:50,321 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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-26 02:49:50,324 INFO L168 Benchmark]: Toolchain (without parser) took 30032.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -124.9 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:50,324 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:49:50,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:50,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.62 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-26 02:49:50,325 INFO L168 Benchmark]: Boogie Preprocessor took 38.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:49:50,325 INFO L168 Benchmark]: RCFGBuilder took 828.10 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:50,326 INFO L168 Benchmark]: TraceAbstraction took 28568.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 225.0 kB). Peak memory consumption was 93.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:49:50,327 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 537.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.62 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. * Boogie Preprocessor took 38.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 828.10 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28568.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 225.0 kB). Peak memory consumption was 93.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...